./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/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 278d8bd7c1a97e577a985a40cd86e40d2394589b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 17:39:07,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:39:07,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:39:07,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:39:07,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:39:07,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:39:07,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:39:07,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:39:07,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:39:07,782 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:39:07,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:39:07,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:39:07,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:39:07,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:39:07,785 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:39:07,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:39:07,786 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:39:07,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:39:07,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:39:07,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:39:07,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:39:07,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:39:07,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:39:07,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:39:07,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:39:07,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:39:07,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:39:07,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:39:07,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:39:07,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:39:07,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:39:07,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:39:07,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:39:07,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:39:07,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:39:07,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:39:07,799 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:39:07,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:39:07,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:39:07,810 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:39:07,810 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:39:07,811 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:39:07,811 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:39:07,812 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:39:07,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:39:07,812 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:39:07,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:39:07,812 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:39:07,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:39:07,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:39:07,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:39:07,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:39:07,814 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_565185be-466b-443b-80c2-81b445e2136d/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 -> 278d8bd7c1a97e577a985a40cd86e40d2394589b [2018-12-08 17:39:07,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:39:07,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:39:07,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:39:07,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:39:07,850 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:39:07,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-12-08 17:39:07,888 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/data/a241d2b6f/57fd446699c045cdb53ceabe31446c34/FLAGf3a11a3a5 [2018-12-08 17:39:08,240 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:39:08,240 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-12-08 17:39:08,248 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/data/a241d2b6f/57fd446699c045cdb53ceabe31446c34/FLAGf3a11a3a5 [2018-12-08 17:39:08,623 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/data/a241d2b6f/57fd446699c045cdb53ceabe31446c34 [2018-12-08 17:39:08,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:39:08,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:39:08,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:39:08,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:39:08,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:39:08,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:08,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08, skipping insertion in model container [2018-12-08 17:39:08,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:08,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:39:08,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:39:08,839 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:39:08,850 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:39:08,941 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:39:08,977 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:39:08,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08 WrapperNode [2018-12-08 17:39:08,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:39:08,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:39:08,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:39:08,978 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:39:08,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:08,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:39:09,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:39:09,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:39:09,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:39:09,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... [2018-12-08 17:39:09,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:39:09,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:39:09,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:39:09,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:39:09,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/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-08 17:39:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 17:39:09,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 17:39:09,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 17:39:09,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 17:39:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:39:09,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:39:09,083 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 17:39:09,396 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:39:09,396 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 17:39:09,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:39:09 BoogieIcfgContainer [2018-12-08 17:39:09,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:39:09,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:39:09,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:39:09,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:39:09,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:39:08" (1/3) ... [2018-12-08 17:39:09,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e131d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:39:09, skipping insertion in model container [2018-12-08 17:39:09,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:39:08" (2/3) ... [2018-12-08 17:39:09,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e131d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:39:09, skipping insertion in model container [2018-12-08 17:39:09,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:39:09" (3/3) ... [2018-12-08 17:39:09,401 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt_false-unreach-call.i [2018-12-08 17:39:09,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,425 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,428 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:39:09,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 17:39:09,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:39:09,441 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 17:39:09,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 17:39:09,466 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:39:09,467 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:39:09,467 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:39:09,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:39:09,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:39:09,467 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:39:09,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:39:09,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:39:09,473 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-08 17:39:24,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-08 17:39:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-08 17:39:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 17:39:24,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:39:24,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:39:24,865 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:39:24,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:39:24,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-08 17:39:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:39:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:39:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:24,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:39:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:39:25,018 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-08 17:39:25,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:39:25,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:39:25,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:39:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:39:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:39:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:39:25,032 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-08 17:39:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:39:27,842 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-08 17:39:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:39:27,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-08 17:39:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:39:28,575 INFO L225 Difference]: With dead ends: 233471 [2018-12-08 17:39:28,575 INFO L226 Difference]: Without dead ends: 203721 [2018-12-08 17:39:28,576 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-08 17:39:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-08 17:39:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-08 17:39:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-08 17:39:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-08 17:39:32,273 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-08 17:39:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:39:32,274 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-08 17:39:32,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:39:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-08 17:39:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:39:32,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:39:32,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:39:32,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:39:32,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:39:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-08 17:39:32,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:39:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:32,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:39:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:32,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:39:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:39:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:39:32,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:39:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:39:32,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:39:32,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:39:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:39:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:39:32,329 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-08 17:39:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:39:32,947 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-08 17:39:32,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:39:32,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-08 17:39:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:39:33,257 INFO L225 Difference]: With dead ends: 118891 [2018-12-08 17:39:33,257 INFO L226 Difference]: Without dead ends: 118891 [2018-12-08 17:39:33,258 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-08 17:39:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-08 17:39:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-08 17:39:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-08 17:39:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-08 17:39:35,923 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-08 17:39:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:39:35,923 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-08 17:39:35,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:39:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-08 17:39:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:39:35,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:39:35,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:39:35,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:39:35,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:39:35,928 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-08 17:39:35,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:39:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:39:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:35,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:39:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:39:35,988 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-08 17:39:35,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:39:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:39:35,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:39:35,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:39:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:39:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:39:35,990 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-08 17:39:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:39:37,967 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-08 17:39:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:39:37,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-08 17:39:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:39:38,831 INFO L225 Difference]: With dead ends: 325271 [2018-12-08 17:39:38,831 INFO L226 Difference]: Without dead ends: 324271 [2018-12-08 17:39:38,831 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-08 17:39:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-08 17:39:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-08 17:39:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-08 17:39:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-08 17:39:46,390 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-08 17:39:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:39:46,390 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-08 17:39:46,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:39:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-08 17:39:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:39:46,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:39:46,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:39:46,396 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:39:46,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:39:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-08 17:39:46,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:39:46,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:46,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:39:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:46,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:39:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:39:46,439 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-08 17:39:46,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:39:46,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:39:46,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:39:46,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:39:46,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:39:46,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:39:46,440 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-08 17:39:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:39:47,628 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-08 17:39:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:39:47,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-08 17:39:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:39:48,010 INFO L225 Difference]: With dead ends: 163597 [2018-12-08 17:39:48,010 INFO L226 Difference]: Without dead ends: 160992 [2018-12-08 17:39:48,010 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-08 17:39:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-08 17:39:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-08 17:39:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-08 17:39:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-08 17:39:53,392 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-08 17:39:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:39:53,392 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-08 17:39:53,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:39:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-08 17:39:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 17:39:53,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:39:53,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:39:53,397 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:39:53,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:39:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-08 17:39:53,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:39:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:53,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:39:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:39:53,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:39:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:39:53,435 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-08 17:39:53,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:39:53,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:39:53,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:39:53,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:39:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:39:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:39:53,436 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-08 17:39:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:39:55,172 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-08 17:39:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:39:55,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-08 17:39:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:39:55,936 INFO L225 Difference]: With dead ends: 289848 [2018-12-08 17:39:55,937 INFO L226 Difference]: Without dead ends: 289008 [2018-12-08 17:39:55,937 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-08 17:39:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-08 17:40:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-08 17:40:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-08 17:40:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-08 17:40:02,840 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-08 17:40:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:02,841 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-08 17:40:02,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-08 17:40:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:40:02,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:02,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:02,863 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:02,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-12-08 17:40:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:02,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:02,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:02,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:02,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:02,918 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-08 17:40:02,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:02,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:02,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:02,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:02,919 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-08 17:40:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:04,844 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-08 17:40:04,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:40:04,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-08 17:40:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:06,041 INFO L225 Difference]: With dead ends: 292568 [2018-12-08 17:40:06,041 INFO L226 Difference]: Without dead ends: 291728 [2018-12-08 17:40:06,042 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-08 17:40:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-08 17:40:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-08 17:40:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-08 17:40:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-08 17:40:10,583 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-08 17:40:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:10,583 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-08 17:40:10,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-08 17:40:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 17:40:10,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:10,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:10,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:10,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-08 17:40:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:10,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:10,691 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-08 17:40:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:40:10,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:10,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:40:10,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:40:10,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:40:10,692 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-08 17:40:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:12,712 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-08 17:40:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:40:12,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-08 17:40:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:13,372 INFO L225 Difference]: With dead ends: 264420 [2018-12-08 17:40:13,372 INFO L226 Difference]: Without dead ends: 263060 [2018-12-08 17:40:13,372 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-08 17:40:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-08 17:40:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-08 17:40:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-08 17:40:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-08 17:40:20,549 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-08 17:40:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:20,549 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-08 17:40:20,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:40:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-08 17:40:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 17:40:20,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:20,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:20,637 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:20,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-08 17:40:20,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:20,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:20,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:20,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:20,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:20,683 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-08 17:40:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:40:20,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:20,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:40:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:40:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:20,684 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-08 17:40:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:21,388 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-08 17:40:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:40:21,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-08 17:40:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:21,539 INFO L225 Difference]: With dead ends: 78044 [2018-12-08 17:40:21,539 INFO L226 Difference]: Without dead ends: 75732 [2018-12-08 17:40:21,539 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-08 17:40:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-08 17:40:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-08 17:40:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-08 17:40:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-08 17:40:22,636 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-08 17:40:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:22,636 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-08 17:40:22,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-08 17:40:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:40:22,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:22,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:22,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:22,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-08 17:40:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:22,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:22,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:22,740 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-08 17:40:22,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:22,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:40:22,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:22,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:40:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:40:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:40:22,742 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-08 17:40:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:23,587 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-08 17:40:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:40:23,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 17:40:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:23,808 INFO L225 Difference]: With dead ends: 105528 [2018-12-08 17:40:23,808 INFO L226 Difference]: Without dead ends: 105528 [2018-12-08 17:40:23,808 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-08 17:40:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-08 17:40:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-08 17:40:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-08 17:40:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-08 17:40:25,149 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-08 17:40:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:25,149 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-08 17:40:25,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:40:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-08 17:40:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:40:25,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:25,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:25,208 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:25,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:25,208 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-08 17:40:25,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:25,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:25,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:25,440 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-08 17:40:25,457 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-08 17:40:25,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:25,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:40:25,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:25,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:40:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:40:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:40:25,458 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-08 17:40:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:26,226 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-08 17:40:26,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:40:26,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 17:40:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:26,467 INFO L225 Difference]: With dead ends: 113667 [2018-12-08 17:40:26,467 INFO L226 Difference]: Without dead ends: 113667 [2018-12-08 17:40:26,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-08 17:40:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-08 17:40:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-08 17:40:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-08 17:40:28,300 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-08 17:40:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:28,300 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-08 17:40:28,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:40:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-08 17:40:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:40:28,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:28,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:28,378 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:28,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-08 17:40:28,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:28,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:28,485 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-08 17:40:28,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:28,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:40:28,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:28,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:40:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:40:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:40:28,485 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-12-08 17:40:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:29,713 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-12-08 17:40:29,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:40:29,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-08 17:40:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:30,038 INFO L225 Difference]: With dead ends: 155234 [2018-12-08 17:40:30,038 INFO L226 Difference]: Without dead ends: 154210 [2018-12-08 17:40:30,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:40:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-12-08 17:40:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-12-08 17:40:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-12-08 17:40:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-12-08 17:40:34,205 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-12-08 17:40:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:34,205 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-12-08 17:40:34,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:40:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-12-08 17:40:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:40:34,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:34,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:40:34,291 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:34,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-12-08 17:40:34,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:34,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:34,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:34,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:34,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:34,378 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-08 17:40:34,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:34,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:34,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:34,379 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-12-08 17:40:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:35,004 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-12-08 17:40:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:40:35,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-08 17:40:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:35,268 INFO L225 Difference]: With dead ends: 124463 [2018-12-08 17:40:35,268 INFO L226 Difference]: Without dead ends: 124463 [2018-12-08 17:40:35,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:40:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-12-08 17:40:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-12-08 17:40:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-12-08 17:40:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-12-08 17:40:37,157 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-12-08 17:40:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:37,157 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-12-08 17:40:37,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-12-08 17:40:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:40:37,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:37,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:37,251 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:37,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-12-08 17:40:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:37,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:37,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:37,292 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-08 17:40:37,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:37,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:37,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:37,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:37,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:37,293 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 6 states. [2018-12-08 17:40:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:37,394 INFO L93 Difference]: Finished difference Result 20396 states and 68134 transitions. [2018-12-08 17:40:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:40:37,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-08 17:40:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:37,423 INFO L225 Difference]: With dead ends: 20396 [2018-12-08 17:40:37,423 INFO L226 Difference]: Without dead ends: 17062 [2018-12-08 17:40:37,424 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-08 17:40:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2018-12-08 17:40:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 15577. [2018-12-08 17:40:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15577 states. [2018-12-08 17:40:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15577 states to 15577 states and 52276 transitions. [2018-12-08 17:40:37,597 INFO L78 Accepts]: Start accepts. Automaton has 15577 states and 52276 transitions. Word has length 78 [2018-12-08 17:40:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:37,597 INFO L480 AbstractCegarLoop]: Abstraction has 15577 states and 52276 transitions. [2018-12-08 17:40:37,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 15577 states and 52276 transitions. [2018-12-08 17:40:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:40:37,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:37,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:37,612 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:37,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2014372351, now seen corresponding path program 1 times [2018-12-08 17:40:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:37,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:37,646 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-08 17:40:37,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:37,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:40:37,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:37,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:40:37,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:40:37,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:37,647 INFO L87 Difference]: Start difference. First operand 15577 states and 52276 transitions. Second operand 5 states. [2018-12-08 17:40:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:37,803 INFO L93 Difference]: Finished difference Result 17227 states and 57291 transitions. [2018-12-08 17:40:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:40:37,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-08 17:40:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:37,898 INFO L225 Difference]: With dead ends: 17227 [2018-12-08 17:40:37,898 INFO L226 Difference]: Without dead ends: 17227 [2018-12-08 17:40:37,898 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-08 17:40:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17227 states. [2018-12-08 17:40:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17227 to 15767. [2018-12-08 17:40:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15767 states. [2018-12-08 17:40:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15767 states to 15767 states and 52948 transitions. [2018-12-08 17:40:38,059 INFO L78 Accepts]: Start accepts. Automaton has 15767 states and 52948 transitions. Word has length 97 [2018-12-08 17:40:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:38,060 INFO L480 AbstractCegarLoop]: Abstraction has 15767 states and 52948 transitions. [2018-12-08 17:40:38,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 15767 states and 52948 transitions. [2018-12-08 17:40:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:40:38,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:38,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:38,076 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:38,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1097247648, now seen corresponding path program 1 times [2018-12-08 17:40:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:38,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:38,130 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-08 17:40:38,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:38,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:38,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:38,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:38,131 INFO L87 Difference]: Start difference. First operand 15767 states and 52948 transitions. Second operand 6 states. [2018-12-08 17:40:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:38,426 INFO L93 Difference]: Finished difference Result 18487 states and 61234 transitions. [2018-12-08 17:40:38,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:40:38,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-08 17:40:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:38,446 INFO L225 Difference]: With dead ends: 18487 [2018-12-08 17:40:38,446 INFO L226 Difference]: Without dead ends: 18127 [2018-12-08 17:40:38,447 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-08 17:40:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2018-12-08 17:40:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17597. [2018-12-08 17:40:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2018-12-08 17:40:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 58832 transitions. [2018-12-08 17:40:38,646 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 58832 transitions. Word has length 97 [2018-12-08 17:40:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:38,647 INFO L480 AbstractCegarLoop]: Abstraction has 17597 states and 58832 transitions. [2018-12-08 17:40:38,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 58832 transitions. [2018-12-08 17:40:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:40:38,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:38,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:38,670 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:38,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2007469309, now seen corresponding path program 2 times [2018-12-08 17:40:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:38,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:38,707 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-08 17:40:38,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:38,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:40:38,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:38,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:40:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:40:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:38,708 INFO L87 Difference]: Start difference. First operand 17597 states and 58832 transitions. Second operand 5 states. [2018-12-08 17:40:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:38,862 INFO L93 Difference]: Finished difference Result 23304 states and 76607 transitions. [2018-12-08 17:40:38,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:40:38,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-08 17:40:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:38,888 INFO L225 Difference]: With dead ends: 23304 [2018-12-08 17:40:38,888 INFO L226 Difference]: Without dead ends: 23144 [2018-12-08 17:40:38,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23144 states. [2018-12-08 17:40:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23144 to 19330. [2018-12-08 17:40:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19330 states. [2018-12-08 17:40:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 64347 transitions. [2018-12-08 17:40:39,113 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 64347 transitions. Word has length 97 [2018-12-08 17:40:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:39,113 INFO L480 AbstractCegarLoop]: Abstraction has 19330 states and 64347 transitions. [2018-12-08 17:40:39,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 64347 transitions. [2018-12-08 17:40:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:40:39,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:39,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:39,132 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:39,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1611451429, now seen corresponding path program 3 times [2018-12-08 17:40:39,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:39,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:39,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:39,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:39,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:39,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-08 17:40:39,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:39,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:40:39,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:39,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:40:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:40:39,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:39,187 INFO L87 Difference]: Start difference. First operand 19330 states and 64347 transitions. Second operand 7 states. [2018-12-08 17:40:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:39,457 INFO L93 Difference]: Finished difference Result 23210 states and 76033 transitions. [2018-12-08 17:40:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:40:39,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-08 17:40:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:39,482 INFO L225 Difference]: With dead ends: 23210 [2018-12-08 17:40:39,482 INFO L226 Difference]: Without dead ends: 22835 [2018-12-08 17:40:39,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:40:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22835 states. [2018-12-08 17:40:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22835 to 19315. [2018-12-08 17:40:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2018-12-08 17:40:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 64230 transitions. [2018-12-08 17:40:39,705 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 64230 transitions. Word has length 97 [2018-12-08 17:40:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:39,706 INFO L480 AbstractCegarLoop]: Abstraction has 19315 states and 64230 transitions. [2018-12-08 17:40:39,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:40:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 64230 transitions. [2018-12-08 17:40:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:40:39,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:39,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:39,724 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-12-08 17:40:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:39,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:39,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:39,780 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-08 17:40:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:39,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:39,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:39,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:39,781 INFO L87 Difference]: Start difference. First operand 19315 states and 64230 transitions. Second operand 6 states. [2018-12-08 17:40:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:39,942 INFO L93 Difference]: Finished difference Result 22820 states and 73489 transitions. [2018-12-08 17:40:39,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:40:39,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-08 17:40:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:39,967 INFO L225 Difference]: With dead ends: 22820 [2018-12-08 17:40:39,967 INFO L226 Difference]: Without dead ends: 22745 [2018-12-08 17:40:39,967 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-08 17:40:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22745 states. [2018-12-08 17:40:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22745 to 20185. [2018-12-08 17:40:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20185 states. [2018-12-08 17:40:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20185 states to 20185 states and 66021 transitions. [2018-12-08 17:40:40,247 INFO L78 Accepts]: Start accepts. Automaton has 20185 states and 66021 transitions. Word has length 97 [2018-12-08 17:40:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:40,247 INFO L480 AbstractCegarLoop]: Abstraction has 20185 states and 66021 transitions. [2018-12-08 17:40:40,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20185 states and 66021 transitions. [2018-12-08 17:40:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 17:40:40,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:40,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, 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-08 17:40:40,265 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:40,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-12-08 17:40:40,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:40,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:40,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:40,296 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-08 17:40:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:40:40,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:40,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:40:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:40:40,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:40,297 INFO L87 Difference]: Start difference. First operand 20185 states and 66021 transitions. Second operand 5 states. [2018-12-08 17:40:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:40,460 INFO L93 Difference]: Finished difference Result 25977 states and 83364 transitions. [2018-12-08 17:40:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:40:40,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-08 17:40:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:40,491 INFO L225 Difference]: With dead ends: 25977 [2018-12-08 17:40:40,491 INFO L226 Difference]: Without dead ends: 25442 [2018-12-08 17:40:40,491 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-08 17:40:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25442 states. [2018-12-08 17:40:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25442 to 20955. [2018-12-08 17:40:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20955 states. [2018-12-08 17:40:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20955 states to 20955 states and 68022 transitions. [2018-12-08 17:40:40,740 INFO L78 Accepts]: Start accepts. Automaton has 20955 states and 68022 transitions. Word has length 97 [2018-12-08 17:40:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:40,740 INFO L480 AbstractCegarLoop]: Abstraction has 20955 states and 68022 transitions. [2018-12-08 17:40:40,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20955 states and 68022 transitions. [2018-12-08 17:40:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:40,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:40,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:40,758 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:40,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-12-08 17:40:40,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:40,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:40,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:40,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:40,841 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-08 17:40:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:40:40,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:40,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:40:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:40:40,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:40:40,842 INFO L87 Difference]: Start difference. First operand 20955 states and 68022 transitions. Second operand 9 states. [2018-12-08 17:40:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:41,506 INFO L93 Difference]: Finished difference Result 35170 states and 112670 transitions. [2018-12-08 17:40:41,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 17:40:41,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-08 17:40:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:41,547 INFO L225 Difference]: With dead ends: 35170 [2018-12-08 17:40:41,547 INFO L226 Difference]: Without dead ends: 35042 [2018-12-08 17:40:41,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-08 17:40:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35042 states. [2018-12-08 17:40:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35042 to 23768. [2018-12-08 17:40:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-12-08 17:40:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 77120 transitions. [2018-12-08 17:40:41,852 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 77120 transitions. Word has length 99 [2018-12-08 17:40:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:41,853 INFO L480 AbstractCegarLoop]: Abstraction has 23768 states and 77120 transitions. [2018-12-08 17:40:41,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:40:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 77120 transitions. [2018-12-08 17:40:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:41,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:41,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:41,883 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:41,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-12-08 17:40:41,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:41,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:41,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:42,008 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-08 17:40:42,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:42,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:40:42,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:42,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:40:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:40:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:42,008 INFO L87 Difference]: Start difference. First operand 23768 states and 77120 transitions. Second operand 7 states. [2018-12-08 17:40:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:42,420 INFO L93 Difference]: Finished difference Result 37316 states and 120409 transitions. [2018-12-08 17:40:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:40:42,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:40:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:42,463 INFO L225 Difference]: With dead ends: 37316 [2018-12-08 17:40:42,463 INFO L226 Difference]: Without dead ends: 36421 [2018-12-08 17:40:42,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:40:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2018-12-08 17:40:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 23258. [2018-12-08 17:40:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23258 states. [2018-12-08 17:40:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23258 states to 23258 states and 75202 transitions. [2018-12-08 17:40:42,851 INFO L78 Accepts]: Start accepts. Automaton has 23258 states and 75202 transitions. Word has length 99 [2018-12-08 17:40:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:42,851 INFO L480 AbstractCegarLoop]: Abstraction has 23258 states and 75202 transitions. [2018-12-08 17:40:42,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:40:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23258 states and 75202 transitions. [2018-12-08 17:40:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:42,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:42,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:42,874 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:42,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-12-08 17:40:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:42,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:42,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:42,937 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-08 17:40:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:42,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:42,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:42,938 INFO L87 Difference]: Start difference. First operand 23258 states and 75202 transitions. Second operand 6 states. [2018-12-08 17:40:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:43,065 INFO L93 Difference]: Finished difference Result 18999 states and 61501 transitions. [2018-12-08 17:40:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:40:43,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 17:40:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:43,087 INFO L225 Difference]: With dead ends: 18999 [2018-12-08 17:40:43,087 INFO L226 Difference]: Without dead ends: 18999 [2018-12-08 17:40:43,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:40:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18999 states. [2018-12-08 17:40:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18999 to 17499. [2018-12-08 17:40:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17499 states. [2018-12-08 17:40:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17499 states to 17499 states and 57066 transitions. [2018-12-08 17:40:43,286 INFO L78 Accepts]: Start accepts. Automaton has 17499 states and 57066 transitions. Word has length 99 [2018-12-08 17:40:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:43,286 INFO L480 AbstractCegarLoop]: Abstraction has 17499 states and 57066 transitions. [2018-12-08 17:40:43,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17499 states and 57066 transitions. [2018-12-08 17:40:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:43,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:43,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:43,303 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:43,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:43,303 INFO L82 PathProgramCache]: Analyzing trace with hash 881084081, now seen corresponding path program 1 times [2018-12-08 17:40:43,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:43,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:43,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:43,354 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-08 17:40:43,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:43,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:40:43,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:43,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:40:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:40:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:43,355 INFO L87 Difference]: Start difference. First operand 17499 states and 57066 transitions. Second operand 7 states. [2018-12-08 17:40:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:43,621 INFO L93 Difference]: Finished difference Result 19038 states and 61795 transitions. [2018-12-08 17:40:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:40:43,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:40:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:43,643 INFO L225 Difference]: With dead ends: 19038 [2018-12-08 17:40:43,643 INFO L226 Difference]: Without dead ends: 19038 [2018-12-08 17:40:43,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2018-12-08 17:40:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 17409. [2018-12-08 17:40:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17409 states. [2018-12-08 17:40:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 56814 transitions. [2018-12-08 17:40:43,838 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 56814 transitions. Word has length 99 [2018-12-08 17:40:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:43,838 INFO L480 AbstractCegarLoop]: Abstraction has 17409 states and 56814 transitions. [2018-12-08 17:40:43,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:40:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 56814 transitions. [2018-12-08 17:40:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:43,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:43,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:43,856 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:43,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2003003695, now seen corresponding path program 1 times [2018-12-08 17:40:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:43,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:43,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:43,928 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-08 17:40:43,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:40:43,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:43,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:40:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:40:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:40:43,929 INFO L87 Difference]: Start difference. First operand 17409 states and 56814 transitions. Second operand 8 states. [2018-12-08 17:40:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:44,198 INFO L93 Difference]: Finished difference Result 22228 states and 71934 transitions. [2018-12-08 17:40:44,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:40:44,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-08 17:40:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:44,222 INFO L225 Difference]: With dead ends: 22228 [2018-12-08 17:40:44,222 INFO L226 Difference]: Without dead ends: 22100 [2018-12-08 17:40:44,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:40:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22100 states. [2018-12-08 17:40:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22100 to 17738. [2018-12-08 17:40:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17738 states. [2018-12-08 17:40:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17738 states to 17738 states and 57613 transitions. [2018-12-08 17:40:44,440 INFO L78 Accepts]: Start accepts. Automaton has 17738 states and 57613 transitions. Word has length 99 [2018-12-08 17:40:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:44,440 INFO L480 AbstractCegarLoop]: Abstraction has 17738 states and 57613 transitions. [2018-12-08 17:40:44,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:40:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17738 states and 57613 transitions. [2018-12-08 17:40:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:44,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:44,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:44,457 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:44,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1041389678, now seen corresponding path program 1 times [2018-12-08 17:40:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:44,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:44,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:44,512 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-08 17:40:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:44,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:40:44,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:44,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:40:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:40:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:44,513 INFO L87 Difference]: Start difference. First operand 17738 states and 57613 transitions. Second operand 7 states. [2018-12-08 17:40:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:44,747 INFO L93 Difference]: Finished difference Result 23099 states and 74558 transitions. [2018-12-08 17:40:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:40:44,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 17:40:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:44,772 INFO L225 Difference]: With dead ends: 23099 [2018-12-08 17:40:44,772 INFO L226 Difference]: Without dead ends: 23099 [2018-12-08 17:40:44,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:40:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23099 states. [2018-12-08 17:40:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23099 to 19145. [2018-12-08 17:40:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19145 states. [2018-12-08 17:40:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 62246 transitions. [2018-12-08 17:40:44,988 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 62246 transitions. Word has length 99 [2018-12-08 17:40:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:44,988 INFO L480 AbstractCegarLoop]: Abstraction has 19145 states and 62246 transitions. [2018-12-08 17:40:44,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:40:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 62246 transitions. [2018-12-08 17:40:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:45,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:45,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:40:45,005 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:45,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 203374803, now seen corresponding path program 1 times [2018-12-08 17:40:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:45,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:45,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:45,144 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-08 17:40:45,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:45,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:40:45,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:45,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:40:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:40:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:45,144 INFO L87 Difference]: Start difference. First operand 19145 states and 62246 transitions. Second operand 5 states. [2018-12-08 17:40:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:45,228 INFO L93 Difference]: Finished difference Result 28269 states and 93441 transitions. [2018-12-08 17:40:45,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:40:45,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 17:40:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:45,265 INFO L225 Difference]: With dead ends: 28269 [2018-12-08 17:40:45,265 INFO L226 Difference]: Without dead ends: 28269 [2018-12-08 17:40:45,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28269 states. [2018-12-08 17:40:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28269 to 17378. [2018-12-08 17:40:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17378 states. [2018-12-08 17:40:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17378 states to 17378 states and 56135 transitions. [2018-12-08 17:40:45,495 INFO L78 Accepts]: Start accepts. Automaton has 17378 states and 56135 transitions. Word has length 99 [2018-12-08 17:40:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:45,496 INFO L480 AbstractCegarLoop]: Abstraction has 17378 states and 56135 transitions. [2018-12-08 17:40:45,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 17378 states and 56135 transitions. [2018-12-08 17:40:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 17:40:45,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:45,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:45,512 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:45,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash 684091219, now seen corresponding path program 1 times [2018-12-08 17:40:45,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:45,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:45,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:45,577 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-08 17:40:45,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:45,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:40:45,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:45,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:40:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:40:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:40:45,578 INFO L87 Difference]: Start difference. First operand 17378 states and 56135 transitions. Second operand 6 states. [2018-12-08 17:40:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:45,704 INFO L93 Difference]: Finished difference Result 15906 states and 50519 transitions. [2018-12-08 17:40:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:40:45,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 17:40:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:45,720 INFO L225 Difference]: With dead ends: 15906 [2018-12-08 17:40:45,720 INFO L226 Difference]: Without dead ends: 15906 [2018-12-08 17:40:45,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:40:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15906 states. [2018-12-08 17:40:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15906 to 12495. [2018-12-08 17:40:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12495 states. [2018-12-08 17:40:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12495 states to 12495 states and 40503 transitions. [2018-12-08 17:40:45,866 INFO L78 Accepts]: Start accepts. Automaton has 12495 states and 40503 transitions. Word has length 99 [2018-12-08 17:40:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:45,866 INFO L480 AbstractCegarLoop]: Abstraction has 12495 states and 40503 transitions. [2018-12-08 17:40:45,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:40:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 12495 states and 40503 transitions. [2018-12-08 17:40:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 17:40:45,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:45,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:45,878 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:45,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:45,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-08 17:40:45,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:45,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:45,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:45,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:45,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:45,917 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-08 17:40:45,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:45,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:40:45,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:45,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:40:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:40:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:40:45,917 INFO L87 Difference]: Start difference. First operand 12495 states and 40503 transitions. Second operand 5 states. [2018-12-08 17:40:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:46,050 INFO L93 Difference]: Finished difference Result 13903 states and 45015 transitions. [2018-12-08 17:40:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:40:46,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 17:40:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:46,066 INFO L225 Difference]: With dead ends: 13903 [2018-12-08 17:40:46,066 INFO L226 Difference]: Without dead ends: 13775 [2018-12-08 17:40:46,066 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-08 17:40:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13775 states. [2018-12-08 17:40:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13775 to 11719. [2018-12-08 17:40:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11719 states. [2018-12-08 17:40:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11719 states to 11719 states and 38008 transitions. [2018-12-08 17:40:46,196 INFO L78 Accepts]: Start accepts. Automaton has 11719 states and 38008 transitions. Word has length 101 [2018-12-08 17:40:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:46,196 INFO L480 AbstractCegarLoop]: Abstraction has 11719 states and 38008 transitions. [2018-12-08 17:40:46,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:40:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 11719 states and 38008 transitions. [2018-12-08 17:40:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 17:40:46,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:46,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:46,208 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:46,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-08 17:40:46,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:46,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:46,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:46,273 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-08 17:40:46,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:46,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:40:46,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:46,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:40:46,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:40:46,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:46,274 INFO L87 Difference]: Start difference. First operand 11719 states and 38008 transitions. Second operand 7 states. [2018-12-08 17:40:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:46,459 INFO L93 Difference]: Finished difference Result 22183 states and 72336 transitions. [2018-12-08 17:40:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:40:46,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-08 17:40:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:46,471 INFO L225 Difference]: With dead ends: 22183 [2018-12-08 17:40:46,472 INFO L226 Difference]: Without dead ends: 11319 [2018-12-08 17:40:46,472 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-08 17:40:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2018-12-08 17:40:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 11059. [2018-12-08 17:40:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11059 states. [2018-12-08 17:40:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11059 states to 11059 states and 36088 transitions. [2018-12-08 17:40:46,583 INFO L78 Accepts]: Start accepts. Automaton has 11059 states and 36088 transitions. Word has length 101 [2018-12-08 17:40:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:46,583 INFO L480 AbstractCegarLoop]: Abstraction has 11059 states and 36088 transitions. [2018-12-08 17:40:46,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:40:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 11059 states and 36088 transitions. [2018-12-08 17:40:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 17:40:46,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:46,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:46,593 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:46,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash -671833209, now seen corresponding path program 2 times [2018-12-08 17:40:46,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:46,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:46,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:46,667 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-08 17:40:46,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:46,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:40:46,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:46,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:40:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:40:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:40:46,668 INFO L87 Difference]: Start difference. First operand 11059 states and 36088 transitions. Second operand 7 states. [2018-12-08 17:40:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:46,884 INFO L93 Difference]: Finished difference Result 18635 states and 61462 transitions. [2018-12-08 17:40:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:40:46,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-08 17:40:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:46,892 INFO L225 Difference]: With dead ends: 18635 [2018-12-08 17:40:46,893 INFO L226 Difference]: Without dead ends: 7616 [2018-12-08 17:40:46,893 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-08 17:40:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-12-08 17:40:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-12-08 17:40:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-12-08 17:40:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25482 transitions. [2018-12-08 17:40:46,974 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25482 transitions. Word has length 101 [2018-12-08 17:40:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:46,974 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25482 transitions. [2018-12-08 17:40:46,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:40:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25482 transitions. [2018-12-08 17:40:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 17:40:46,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:46,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:46,982 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:46,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1490274765, now seen corresponding path program 3 times [2018-12-08 17:40:46,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:46,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:46,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:46,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:46,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:47,080 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-08 17:40:47,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:47,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:40:47,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:40:47,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:40:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:40:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:40:47,081 INFO L87 Difference]: Start difference. First operand 7616 states and 25482 transitions. Second operand 12 states. [2018-12-08 17:40:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:47,472 INFO L93 Difference]: Finished difference Result 14444 states and 48675 transitions. [2018-12-08 17:40:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:40:47,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-08 17:40:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:40:47,483 INFO L225 Difference]: With dead ends: 14444 [2018-12-08 17:40:47,484 INFO L226 Difference]: Without dead ends: 10540 [2018-12-08 17:40:47,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-08 17:40:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-12-08 17:40:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-12-08 17:40:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-08 17:40:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32373 transitions. [2018-12-08 17:40:47,584 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32373 transitions. Word has length 101 [2018-12-08 17:40:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:40:47,585 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32373 transitions. [2018-12-08 17:40:47,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:40:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32373 transitions. [2018-12-08 17:40:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 17:40:47,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:40:47,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:47,660 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:40:47,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1680924215, now seen corresponding path program 4 times [2018-12-08 17:40:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:40:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:47,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:47,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:47,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:40:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:47,696 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:40:47,786 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 17:40:47,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:40:47 BasicIcfg [2018-12-08 17:40:47,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:40:47,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:40:47,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:40:47,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:40:47,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:39:09" (3/4) ... [2018-12-08 17:40:47,790 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:40:47,878 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_565185be-466b-443b-80c2-81b445e2136d/bin-2019/utaipan/witness.graphml [2018-12-08 17:40:47,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:40:47,879 INFO L168 Benchmark]: Toolchain (without parser) took 99253.35 ms. Allocated memory was 1.0 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 952.4 MB in the beginning and 6.1 GB in the end (delta: -5.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-08 17:40:47,879 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:40:47,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:47,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:40:47,880 INFO L168 Benchmark]: Boogie Preprocessor took 26.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:40:47,880 INFO L168 Benchmark]: RCFGBuilder took 347.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:47,880 INFO L168 Benchmark]: TraceAbstraction took 98390.28 ms. Allocated memory was 1.2 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-08 17:40:47,880 INFO L168 Benchmark]: Witness Printer took 90.35 ms. Allocated memory is still 7.9 GB. Free memory was 6.2 GB in the beginning and 6.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:47,882 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98390.28 ms. Allocated memory was 1.2 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 90.35 ms. Allocated memory is still 7.9 GB. Free memory was 6.2 GB in the beginning and 6.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] -1 pthread_t t2500; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] FCALL, FORK -1 pthread_create(&t2500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t2501; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t2501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2502; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L725] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L787] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 98.3s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 27.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8069 SDtfs, 8151 SDslu, 19998 SDs, 0 SdLazy, 8064 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 107 SyntacticMatches, 21 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 52.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 667571 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2566 ConstructedInterpolants, 0 QuantifiedInterpolants, 587755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...