./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_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_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/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 4d16ad85263306ac9d29b22bbbb80825fd6ef8e4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:19:56,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:19:56,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:19:56,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:19:56,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:19:56,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:19:56,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:19:56,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:19:56,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:19:56,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:19:56,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:19:56,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:19:56,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:19:56,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:19:56,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:19:56,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:19:56,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:19:56,801 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:19:56,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:19:56,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:19:56,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:19:56,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:19:56,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:19:56,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:19:56,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:19:56,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:19:56,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:19:56,806 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:19:56,806 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:19:56,807 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:19:56,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:19:56,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:19:56,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:19:56,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:19:56,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:19:56,808 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:19:56,809 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:19:56,815 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:19:56,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:19:56,816 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:19:56,816 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:19:56,816 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:19:56,816 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:19:56,816 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:19:56,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:19:56,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:19:56,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:19:56,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:19:56,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:19:56,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:19:56,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:19:56,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:19:56,819 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:19:56,819 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:19:56,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:19:56,819 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:19:56,819 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_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/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 -> 4d16ad85263306ac9d29b22bbbb80825fd6ef8e4 [2018-12-09 10:19:56,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:19:56,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:19:56,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:19:56,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:19:56,845 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:19:56,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i [2018-12-09 10:19:56,881 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/data/9bb62bc64/f674e087281f43d184201100ec784452/FLAGf2d75d79b [2018-12-09 10:19:57,317 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:19:57,317 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/sv-benchmarks/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i [2018-12-09 10:19:57,325 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/data/9bb62bc64/f674e087281f43d184201100ec784452/FLAGf2d75d79b [2018-12-09 10:19:57,333 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/data/9bb62bc64/f674e087281f43d184201100ec784452 [2018-12-09 10:19:57,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:19:57,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:19:57,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:19:57,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:19:57,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:19:57,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57, skipping insertion in model container [2018-12-09 10:19:57,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:19:57,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:19:57,551 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:19:57,559 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:19:57,631 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:19:57,660 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:19:57,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57 WrapperNode [2018-12-09 10:19:57,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:19:57,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:19:57,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:19:57,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:19:57,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:19:57,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:19:57,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:19:57,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:19:57,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... [2018-12-09 10:19:57,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:19:57,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:19:57,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:19:57,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:19:57,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:19:57,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:19:57,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:19:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:19:57,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:19:57,743 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 10:19:58,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:19:58,035 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:19:58,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:19:58 BoogieIcfgContainer [2018-12-09 10:19:58,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:19:58,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:19:58,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:19:58,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:19:58,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:19:57" (1/3) ... [2018-12-09 10:19:58,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e986ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:19:58, skipping insertion in model container [2018-12-09 10:19:58,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:57" (2/3) ... [2018-12-09 10:19:58,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e986ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:19:58, skipping insertion in model container [2018-12-09 10:19:58,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:19:58" (3/3) ... [2018-12-09 10:19:58,040 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt_false-unreach-call.i [2018-12-09 10:19:58,060 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,061 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:19:58,071 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:19:58,071 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:19:58,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:19:58,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:19:58,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:19:58,099 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:19:58,099 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:19:58,099 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:19:58,100 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:19:58,100 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:19:58,100 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:19:58,100 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:19:58,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 10:19:59,046 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-09 10:19:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-09 10:19:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 10:19:59,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:19:59,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:19:59,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:19:59,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:19:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-09 10:19:59,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:19:59,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:19:59,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:19:59,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:19:59,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:19:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:19:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:19:59,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:19:59,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:19:59,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:19:59,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:19:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:19:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:19:59,223 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-09 10:19:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:19:59,597 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-09 10:19:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:19:59,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 10:19:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:19:59,743 INFO L225 Difference]: With dead ends: 45389 [2018-12-09 10:19:59,743 INFO L226 Difference]: Without dead ends: 40629 [2018-12-09 10:19:59,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:19:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-09 10:20:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-09 10:20:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 10:20:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-09 10:20:00,427 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-09 10:20:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:00,428 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-09 10:20:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:20:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-09 10:20:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 10:20:00,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:00,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:00,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:00,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-09 10:20:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:00,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:00,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:00,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:00,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:00,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:20:00,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:00,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:20:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:20:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:00,475 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-09 10:20:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:00,637 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-09 10:20:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:20:00,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 10:20:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:00,770 INFO L225 Difference]: With dead ends: 23663 [2018-12-09 10:20:00,770 INFO L226 Difference]: Without dead ends: 23663 [2018-12-09 10:20:00,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-09 10:20:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-09 10:20:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 10:20:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-09 10:20:01,123 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-09 10:20:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:01,124 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-09 10:20:01,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:20:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-09 10:20:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 10:20:01,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:01,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:01,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:01,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1341601382, now seen corresponding path program 1 times [2018-12-09 10:20:01,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:01,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:01,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:01,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:01,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:01,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:01,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:01,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:01,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:01,167 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-09 10:20:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:01,711 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-09 10:20:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:20:01,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 10:20:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:01,821 INFO L225 Difference]: With dead ends: 64831 [2018-12-09 10:20:01,822 INFO L226 Difference]: Without dead ends: 64671 [2018-12-09 10:20:01,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-09 10:20:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-09 10:20:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 10:20:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-09 10:20:02,595 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-09 10:20:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:02,595 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-09 10:20:02,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-09 10:20:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 10:20:02,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:02,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:02,597 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:02,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-09 10:20:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:02,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:02,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:02,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:02,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:02,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:02,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:02,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:02,674 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2018-12-09 10:20:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:03,030 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2018-12-09 10:20:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:20:03,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 10:20:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:03,140 INFO L225 Difference]: With dead ends: 66627 [2018-12-09 10:20:03,140 INFO L226 Difference]: Without dead ends: 66459 [2018-12-09 10:20:03,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-09 10:20:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-09 10:20:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-09 10:20:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2018-12-09 10:20:03,901 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2018-12-09 10:20:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:03,901 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2018-12-09 10:20:03,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2018-12-09 10:20:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 10:20:03,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:03,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:03,907 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:03,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1765825254, now seen corresponding path program 1 times [2018-12-09 10:20:03,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:03,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:03,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:20:03,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:03,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:20:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:20:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:03,957 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 6 states. [2018-12-09 10:20:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:04,707 INFO L93 Difference]: Finished difference Result 68209 states and 246480 transitions. [2018-12-09 10:20:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:20:04,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 10:20:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:04,818 INFO L225 Difference]: With dead ends: 68209 [2018-12-09 10:20:04,819 INFO L226 Difference]: Without dead ends: 68049 [2018-12-09 10:20:04,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 10:20:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68049 states. [2018-12-09 10:20:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68049 to 37685. [2018-12-09 10:20:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37685 states. [2018-12-09 10:20:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37685 states to 37685 states and 139419 transitions. [2018-12-09 10:20:05,529 INFO L78 Accepts]: Start accepts. Automaton has 37685 states and 139419 transitions. Word has length 53 [2018-12-09 10:20:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:05,529 INFO L480 AbstractCegarLoop]: Abstraction has 37685 states and 139419 transitions. [2018-12-09 10:20:05,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:20:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37685 states and 139419 transitions. [2018-12-09 10:20:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 10:20:05,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:05,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:05,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:05,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash 479415254, now seen corresponding path program 1 times [2018-12-09 10:20:05,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:05,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:05,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:05,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:05,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:05,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:05,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:05,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:05,618 INFO L87 Difference]: Start difference. First operand 37685 states and 139419 transitions. Second operand 5 states. [2018-12-09 10:20:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:06,035 INFO L93 Difference]: Finished difference Result 62345 states and 228236 transitions. [2018-12-09 10:20:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:20:06,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-09 10:20:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:06,144 INFO L225 Difference]: With dead ends: 62345 [2018-12-09 10:20:06,145 INFO L226 Difference]: Without dead ends: 62217 [2018-12-09 10:20:06,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62217 states. [2018-12-09 10:20:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62217 to 59563. [2018-12-09 10:20:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59563 states. [2018-12-09 10:20:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59563 states to 59563 states and 218602 transitions. [2018-12-09 10:20:07,029 INFO L78 Accepts]: Start accepts. Automaton has 59563 states and 218602 transitions. Word has length 60 [2018-12-09 10:20:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:07,030 INFO L480 AbstractCegarLoop]: Abstraction has 59563 states and 218602 transitions. [2018-12-09 10:20:07,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 59563 states and 218602 transitions. [2018-12-09 10:20:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 10:20:07,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:07,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:07,049 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:07,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -498734345, now seen corresponding path program 1 times [2018-12-09 10:20:07,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:07,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:07,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:07,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:07,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:20:07,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:07,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:20:07,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:20:07,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:07,101 INFO L87 Difference]: Start difference. First operand 59563 states and 218602 transitions. Second operand 6 states. [2018-12-09 10:20:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:07,704 INFO L93 Difference]: Finished difference Result 123243 states and 444626 transitions. [2018-12-09 10:20:07,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:20:07,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-09 10:20:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:07,931 INFO L225 Difference]: With dead ends: 123243 [2018-12-09 10:20:07,931 INFO L226 Difference]: Without dead ends: 122987 [2018-12-09 10:20:07,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:20:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122987 states. [2018-12-09 10:20:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122987 to 70608. [2018-12-09 10:20:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70608 states. [2018-12-09 10:20:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70608 states to 70608 states and 256170 transitions. [2018-12-09 10:20:09,260 INFO L78 Accepts]: Start accepts. Automaton has 70608 states and 256170 transitions. Word has length 60 [2018-12-09 10:20:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:09,260 INFO L480 AbstractCegarLoop]: Abstraction has 70608 states and 256170 transitions. [2018-12-09 10:20:09,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:20:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 70608 states and 256170 transitions. [2018-12-09 10:20:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 10:20:09,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:09,291 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] [2018-12-09 10:20:09,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:09,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1366410458, now seen corresponding path program 1 times [2018-12-09 10:20:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:09,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:20:09,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:09,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:20:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:20:09,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:09,328 INFO L87 Difference]: Start difference. First operand 70608 states and 256170 transitions. Second operand 3 states. [2018-12-09 10:20:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:09,611 INFO L93 Difference]: Finished difference Result 87464 states and 312384 transitions. [2018-12-09 10:20:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:20:09,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-09 10:20:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:09,757 INFO L225 Difference]: With dead ends: 87464 [2018-12-09 10:20:09,757 INFO L226 Difference]: Without dead ends: 87464 [2018-12-09 10:20:09,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87464 states. [2018-12-09 10:20:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87464 to 75015. [2018-12-09 10:20:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75015 states. [2018-12-09 10:20:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75015 states to 75015 states and 271140 transitions. [2018-12-09 10:20:10,934 INFO L78 Accepts]: Start accepts. Automaton has 75015 states and 271140 transitions. Word has length 62 [2018-12-09 10:20:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:10,935 INFO L480 AbstractCegarLoop]: Abstraction has 75015 states and 271140 transitions. [2018-12-09 10:20:10,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:20:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 75015 states and 271140 transitions. [2018-12-09 10:20:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 10:20:10,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:10,975 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] [2018-12-09 10:20:10,975 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:10,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 817342501, now seen corresponding path program 1 times [2018-12-09 10:20:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:10,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:11,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:11,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 10:20:11,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:11,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:20:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:20:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:20:11,052 INFO L87 Difference]: Start difference. First operand 75015 states and 271140 transitions. Second operand 9 states. [2018-12-09 10:20:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:11,994 INFO L93 Difference]: Finished difference Result 104482 states and 365668 transitions. [2018-12-09 10:20:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 10:20:11,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-12-09 10:20:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:12,175 INFO L225 Difference]: With dead ends: 104482 [2018-12-09 10:20:12,175 INFO L226 Difference]: Without dead ends: 104146 [2018-12-09 10:20:12,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2018-12-09 10:20:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104146 states. [2018-12-09 10:20:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104146 to 80565. [2018-12-09 10:20:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80565 states. [2018-12-09 10:20:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80565 states to 80565 states and 287811 transitions. [2018-12-09 10:20:13,477 INFO L78 Accepts]: Start accepts. Automaton has 80565 states and 287811 transitions. Word has length 66 [2018-12-09 10:20:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:13,477 INFO L480 AbstractCegarLoop]: Abstraction has 80565 states and 287811 transitions. [2018-12-09 10:20:13,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:20:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 80565 states and 287811 transitions. [2018-12-09 10:20:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 10:20:13,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:13,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:13,516 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:13,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash -911785883, now seen corresponding path program 1 times [2018-12-09 10:20:13,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:13,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:13,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:13,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:20:13,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:13,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:20:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:20:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:13,566 INFO L87 Difference]: Start difference. First operand 80565 states and 287811 transitions. Second operand 7 states. [2018-12-09 10:20:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:14,327 INFO L93 Difference]: Finished difference Result 106394 states and 377891 transitions. [2018-12-09 10:20:14,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 10:20:14,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-09 10:20:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:14,514 INFO L225 Difference]: With dead ends: 106394 [2018-12-09 10:20:14,514 INFO L226 Difference]: Without dead ends: 106178 [2018-12-09 10:20:14,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-09 10:20:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106178 states. [2018-12-09 10:20:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106178 to 81246. [2018-12-09 10:20:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81246 states. [2018-12-09 10:20:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81246 states to 81246 states and 290040 transitions. [2018-12-09 10:20:15,967 INFO L78 Accepts]: Start accepts. Automaton has 81246 states and 290040 transitions. Word has length 67 [2018-12-09 10:20:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:15,967 INFO L480 AbstractCegarLoop]: Abstraction has 81246 states and 290040 transitions. [2018-12-09 10:20:15,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:20:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 81246 states and 290040 transitions. [2018-12-09 10:20:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 10:20:16,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:16,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:16,010 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:16,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash -140132620, now seen corresponding path program 1 times [2018-12-09 10:20:16,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:16,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:16,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:16,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:20:16,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:16,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:20:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:20:16,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:16,068 INFO L87 Difference]: Start difference. First operand 81246 states and 290040 transitions. Second operand 6 states. [2018-12-09 10:20:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:16,674 INFO L93 Difference]: Finished difference Result 104945 states and 373406 transitions. [2018-12-09 10:20:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:20:16,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 10:20:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:16,861 INFO L225 Difference]: With dead ends: 104945 [2018-12-09 10:20:16,861 INFO L226 Difference]: Without dead ends: 103753 [2018-12-09 10:20:16,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103753 states. [2018-12-09 10:20:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103753 to 91265. [2018-12-09 10:20:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91265 states. [2018-12-09 10:20:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91265 states to 91265 states and 326881 transitions. [2018-12-09 10:20:18,207 INFO L78 Accepts]: Start accepts. Automaton has 91265 states and 326881 transitions. Word has length 69 [2018-12-09 10:20:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:18,207 INFO L480 AbstractCegarLoop]: Abstraction has 91265 states and 326881 transitions. [2018-12-09 10:20:18,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:20:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 91265 states and 326881 transitions. [2018-12-09 10:20:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 10:20:18,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:18,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:18,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:18,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:18,261 INFO L82 PathProgramCache]: Analyzing trace with hash -423283084, now seen corresponding path program 1 times [2018-12-09 10:20:18,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:18,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:18,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:18,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:18,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:20:18,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:18,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:20:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:20:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:18,320 INFO L87 Difference]: Start difference. First operand 91265 states and 326881 transitions. Second operand 7 states. [2018-12-09 10:20:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:19,199 INFO L93 Difference]: Finished difference Result 121548 states and 425113 transitions. [2018-12-09 10:20:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:20:19,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-09 10:20:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:19,409 INFO L225 Difference]: With dead ends: 121548 [2018-12-09 10:20:19,409 INFO L226 Difference]: Without dead ends: 121548 [2018-12-09 10:20:19,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:20:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121548 states. [2018-12-09 10:20:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121548 to 111954. [2018-12-09 10:20:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111954 states. [2018-12-09 10:20:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111954 states to 111954 states and 394655 transitions. [2018-12-09 10:20:21,029 INFO L78 Accepts]: Start accepts. Automaton has 111954 states and 394655 transitions. Word has length 69 [2018-12-09 10:20:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:21,029 INFO L480 AbstractCegarLoop]: Abstraction has 111954 states and 394655 transitions. [2018-12-09 10:20:21,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:20:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 111954 states and 394655 transitions. [2018-12-09 10:20:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 10:20:21,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:21,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:21,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:21,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash 821481397, now seen corresponding path program 1 times [2018-12-09 10:20:21,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:21,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:21,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:21,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:20:21,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:21,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:20:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:20:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:20:21,137 INFO L87 Difference]: Start difference. First operand 111954 states and 394655 transitions. Second operand 4 states. [2018-12-09 10:20:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:21,234 INFO L93 Difference]: Finished difference Result 33909 states and 108708 transitions. [2018-12-09 10:20:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:20:21,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-09 10:20:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:21,275 INFO L225 Difference]: With dead ends: 33909 [2018-12-09 10:20:21,275 INFO L226 Difference]: Without dead ends: 33368 [2018-12-09 10:20:21,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33368 states. [2018-12-09 10:20:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33368 to 33356. [2018-12-09 10:20:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33356 states. [2018-12-09 10:20:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33356 states to 33356 states and 107064 transitions. [2018-12-09 10:20:21,620 INFO L78 Accepts]: Start accepts. Automaton has 33356 states and 107064 transitions. Word has length 69 [2018-12-09 10:20:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:21,620 INFO L480 AbstractCegarLoop]: Abstraction has 33356 states and 107064 transitions. [2018-12-09 10:20:21,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:20:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33356 states and 107064 transitions. [2018-12-09 10:20:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:20:21,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:21,639 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] [2018-12-09 10:20:21,640 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:21,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -228550946, now seen corresponding path program 1 times [2018-12-09 10:20:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:21,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:21,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:21,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:20:21,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:21,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:20:21,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:20:21,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:20:21,672 INFO L87 Difference]: Start difference. First operand 33356 states and 107064 transitions. Second operand 4 states. [2018-12-09 10:20:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:21,870 INFO L93 Difference]: Finished difference Result 42136 states and 133792 transitions. [2018-12-09 10:20:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:20:21,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 10:20:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:21,919 INFO L225 Difference]: With dead ends: 42136 [2018-12-09 10:20:21,919 INFO L226 Difference]: Without dead ends: 42136 [2018-12-09 10:20:21,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42136 states. [2018-12-09 10:20:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42136 to 34556. [2018-12-09 10:20:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34556 states. [2018-12-09 10:20:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34556 states to 34556 states and 110663 transitions. [2018-12-09 10:20:22,304 INFO L78 Accepts]: Start accepts. Automaton has 34556 states and 110663 transitions. Word has length 79 [2018-12-09 10:20:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:22,305 INFO L480 AbstractCegarLoop]: Abstraction has 34556 states and 110663 transitions. [2018-12-09 10:20:22,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:20:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34556 states and 110663 transitions. [2018-12-09 10:20:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:20:22,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:22,325 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] [2018-12-09 10:20:22,326 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:22,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -483287491, now seen corresponding path program 1 times [2018-12-09 10:20:22,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:22,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:22,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:22,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:22,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:20:22,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:22,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:20:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:20:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:22,385 INFO L87 Difference]: Start difference. First operand 34556 states and 110663 transitions. Second operand 8 states. [2018-12-09 10:20:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:23,106 INFO L93 Difference]: Finished difference Result 37852 states and 120515 transitions. [2018-12-09 10:20:23,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 10:20:23,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-09 10:20:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:23,149 INFO L225 Difference]: With dead ends: 37852 [2018-12-09 10:20:23,149 INFO L226 Difference]: Without dead ends: 37788 [2018-12-09 10:20:23,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-09 10:20:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37788 states. [2018-12-09 10:20:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37788 to 32896. [2018-12-09 10:20:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32896 states. [2018-12-09 10:20:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32896 states to 32896 states and 105718 transitions. [2018-12-09 10:20:23,503 INFO L78 Accepts]: Start accepts. Automaton has 32896 states and 105718 transitions. Word has length 79 [2018-12-09 10:20:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:23,503 INFO L480 AbstractCegarLoop]: Abstraction has 32896 states and 105718 transitions. [2018-12-09 10:20:23,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:20:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32896 states and 105718 transitions. [2018-12-09 10:20:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 10:20:23,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:23,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:23,525 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:23,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 509727806, now seen corresponding path program 1 times [2018-12-09 10:20:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:23,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:23,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:23,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:23,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:20:23,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:23,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:20:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:20:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:23,547 INFO L87 Difference]: Start difference. First operand 32896 states and 105718 transitions. Second operand 3 states. [2018-12-09 10:20:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:23,724 INFO L93 Difference]: Finished difference Result 35246 states and 112862 transitions. [2018-12-09 10:20:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:20:23,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-09 10:20:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:23,766 INFO L225 Difference]: With dead ends: 35246 [2018-12-09 10:20:23,766 INFO L226 Difference]: Without dead ends: 35246 [2018-12-09 10:20:23,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35246 states. [2018-12-09 10:20:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35246 to 34052. [2018-12-09 10:20:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34052 states. [2018-12-09 10:20:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34052 states to 34052 states and 109238 transitions. [2018-12-09 10:20:24,126 INFO L78 Accepts]: Start accepts. Automaton has 34052 states and 109238 transitions. Word has length 80 [2018-12-09 10:20:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:24,127 INFO L480 AbstractCegarLoop]: Abstraction has 34052 states and 109238 transitions. [2018-12-09 10:20:24,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:20:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 34052 states and 109238 transitions. [2018-12-09 10:20:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:20:24,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:24,152 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] [2018-12-09 10:20:24,152 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:24,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash 723145821, now seen corresponding path program 1 times [2018-12-09 10:20:24,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:24,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:24,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:24,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:24,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:24,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:20:24,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:24,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:20:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:20:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:20:24,181 INFO L87 Difference]: Start difference. First operand 34052 states and 109238 transitions. Second operand 4 states. [2018-12-09 10:20:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:24,412 INFO L93 Difference]: Finished difference Result 39918 states and 126690 transitions. [2018-12-09 10:20:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:20:24,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 10:20:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:24,459 INFO L225 Difference]: With dead ends: 39918 [2018-12-09 10:20:24,459 INFO L226 Difference]: Without dead ends: 39854 [2018-12-09 10:20:24,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:20:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39854 states. [2018-12-09 10:20:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39854 to 38182. [2018-12-09 10:20:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38182 states. [2018-12-09 10:20:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38182 states to 38182 states and 121676 transitions. [2018-12-09 10:20:24,870 INFO L78 Accepts]: Start accepts. Automaton has 38182 states and 121676 transitions. Word has length 81 [2018-12-09 10:20:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:24,870 INFO L480 AbstractCegarLoop]: Abstraction has 38182 states and 121676 transitions. [2018-12-09 10:20:24,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:20:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 38182 states and 121676 transitions. [2018-12-09 10:20:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:20:24,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:24,896 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] [2018-12-09 10:20:24,897 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:24,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1212514466, now seen corresponding path program 1 times [2018-12-09 10:20:24,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:24,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:24,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:24,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:20:24,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:24,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:20:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:20:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:24,928 INFO L87 Difference]: Start difference. First operand 38182 states and 121676 transitions. Second operand 3 states. [2018-12-09 10:20:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:25,116 INFO L93 Difference]: Finished difference Result 40636 states and 129116 transitions. [2018-12-09 10:20:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:20:25,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 10:20:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:25,163 INFO L225 Difference]: With dead ends: 40636 [2018-12-09 10:20:25,163 INFO L226 Difference]: Without dead ends: 40636 [2018-12-09 10:20:25,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:20:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40636 states. [2018-12-09 10:20:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40636 to 39416. [2018-12-09 10:20:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39416 states. [2018-12-09 10:20:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39416 states to 39416 states and 125412 transitions. [2018-12-09 10:20:25,577 INFO L78 Accepts]: Start accepts. Automaton has 39416 states and 125412 transitions. Word has length 81 [2018-12-09 10:20:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:25,577 INFO L480 AbstractCegarLoop]: Abstraction has 39416 states and 125412 transitions. [2018-12-09 10:20:25,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:20:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39416 states and 125412 transitions. [2018-12-09 10:20:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:25,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:25,603 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] [2018-12-09 10:20:25,604 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:25,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:25,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1773086822, now seen corresponding path program 1 times [2018-12-09 10:20:25,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:25,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:25,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:25,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:20:25,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:25,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:20:25,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:20:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:25,666 INFO L87 Difference]: Start difference. First operand 39416 states and 125412 transitions. Second operand 6 states. [2018-12-09 10:20:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:26,237 INFO L93 Difference]: Finished difference Result 55112 states and 172292 transitions. [2018-12-09 10:20:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:20:26,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 10:20:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:26,306 INFO L225 Difference]: With dead ends: 55112 [2018-12-09 10:20:26,306 INFO L226 Difference]: Without dead ends: 54244 [2018-12-09 10:20:26,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:20:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54244 states. [2018-12-09 10:20:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54244 to 43200. [2018-12-09 10:20:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43200 states. [2018-12-09 10:20:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43200 states to 43200 states and 137518 transitions. [2018-12-09 10:20:26,817 INFO L78 Accepts]: Start accepts. Automaton has 43200 states and 137518 transitions. Word has length 82 [2018-12-09 10:20:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:26,818 INFO L480 AbstractCegarLoop]: Abstraction has 43200 states and 137518 transitions. [2018-12-09 10:20:26,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:20:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 43200 states and 137518 transitions. [2018-12-09 10:20:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:26,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:26,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:26,847 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:26,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:26,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1489936358, now seen corresponding path program 1 times [2018-12-09 10:20:26,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:26,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:26,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:26,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:26,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:20:26,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:20:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:20:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:26,964 INFO L87 Difference]: Start difference. First operand 43200 states and 137518 transitions. Second operand 7 states. [2018-12-09 10:20:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:28,028 INFO L93 Difference]: Finished difference Result 70224 states and 216706 transitions. [2018-12-09 10:20:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:20:28,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 10:20:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:28,116 INFO L225 Difference]: With dead ends: 70224 [2018-12-09 10:20:28,116 INFO L226 Difference]: Without dead ends: 70112 [2018-12-09 10:20:28,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:20:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70112 states. [2018-12-09 10:20:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70112 to 45217. [2018-12-09 10:20:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45217 states. [2018-12-09 10:20:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45217 states to 45217 states and 141900 transitions. [2018-12-09 10:20:28,723 INFO L78 Accepts]: Start accepts. Automaton has 45217 states and 141900 transitions. Word has length 82 [2018-12-09 10:20:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:28,723 INFO L480 AbstractCegarLoop]: Abstraction has 45217 states and 141900 transitions. [2018-12-09 10:20:28,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:20:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 45217 states and 141900 transitions. [2018-12-09 10:20:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:28,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:28,754 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] [2018-12-09 10:20:28,754 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:28,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1230500696, now seen corresponding path program 1 times [2018-12-09 10:20:28,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:28,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:28,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:28,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:28,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:28,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:20:28,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:28,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:20:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:20:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:28,800 INFO L87 Difference]: Start difference. First operand 45217 states and 141900 transitions. Second operand 7 states. [2018-12-09 10:20:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:29,396 INFO L93 Difference]: Finished difference Result 80985 states and 250735 transitions. [2018-12-09 10:20:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:20:29,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 10:20:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:29,500 INFO L225 Difference]: With dead ends: 80985 [2018-12-09 10:20:29,500 INFO L226 Difference]: Without dead ends: 80057 [2018-12-09 10:20:29,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:20:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80057 states. [2018-12-09 10:20:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80057 to 48414. [2018-12-09 10:20:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48414 states. [2018-12-09 10:20:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48414 states to 48414 states and 151509 transitions. [2018-12-09 10:20:30,154 INFO L78 Accepts]: Start accepts. Automaton has 48414 states and 151509 transitions. Word has length 82 [2018-12-09 10:20:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:30,155 INFO L480 AbstractCegarLoop]: Abstraction has 48414 states and 151509 transitions. [2018-12-09 10:20:30,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:20:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 48414 states and 151509 transitions. [2018-12-09 10:20:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:30,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:30,187 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] [2018-12-09 10:20:30,187 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:30,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1180169000, now seen corresponding path program 1 times [2018-12-09 10:20:30,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:30,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:30,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:30,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:20:30,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:30,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:20:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:20:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:30,282 INFO L87 Difference]: Start difference. First operand 48414 states and 151509 transitions. Second operand 8 states. [2018-12-09 10:20:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:31,413 INFO L93 Difference]: Finished difference Result 70213 states and 214166 transitions. [2018-12-09 10:20:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 10:20:31,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-09 10:20:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:31,499 INFO L225 Difference]: With dead ends: 70213 [2018-12-09 10:20:31,500 INFO L226 Difference]: Without dead ends: 69157 [2018-12-09 10:20:31,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:20:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69157 states. [2018-12-09 10:20:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69157 to 45584. [2018-12-09 10:20:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45584 states. [2018-12-09 10:20:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45584 states to 45584 states and 142423 transitions. [2018-12-09 10:20:32,094 INFO L78 Accepts]: Start accepts. Automaton has 45584 states and 142423 transitions. Word has length 82 [2018-12-09 10:20:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:32,095 INFO L480 AbstractCegarLoop]: Abstraction has 45584 states and 142423 transitions. [2018-12-09 10:20:32,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:20:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 45584 states and 142423 transitions. [2018-12-09 10:20:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:32,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:32,125 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] [2018-12-09 10:20:32,125 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:32,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2141783017, now seen corresponding path program 1 times [2018-12-09 10:20:32,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:32,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:32,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:32,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:20:32,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:32,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:20:32,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:20:32,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:32,184 INFO L87 Difference]: Start difference. First operand 45584 states and 142423 transitions. Second operand 8 states. [2018-12-09 10:20:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:32,947 INFO L93 Difference]: Finished difference Result 58168 states and 179750 transitions. [2018-12-09 10:20:32,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:20:32,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-09 10:20:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:33,012 INFO L225 Difference]: With dead ends: 58168 [2018-12-09 10:20:33,012 INFO L226 Difference]: Without dead ends: 58168 [2018-12-09 10:20:33,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:20:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58168 states. [2018-12-09 10:20:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58168 to 40816. [2018-12-09 10:20:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40816 states. [2018-12-09 10:20:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40816 states to 40816 states and 127559 transitions. [2018-12-09 10:20:33,514 INFO L78 Accepts]: Start accepts. Automaton has 40816 states and 127559 transitions. Word has length 82 [2018-12-09 10:20:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:33,514 INFO L480 AbstractCegarLoop]: Abstraction has 40816 states and 127559 transitions. [2018-12-09 10:20:33,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:20:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40816 states and 127559 transitions. [2018-12-09 10:20:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:33,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:33,540 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] [2018-12-09 10:20:33,540 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:33,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:33,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1672467863, now seen corresponding path program 1 times [2018-12-09 10:20:33,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:33,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:33,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:33,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:33,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 10:20:33,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:33,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:20:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:20:33,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:20:33,610 INFO L87 Difference]: Start difference. First operand 40816 states and 127559 transitions. Second operand 9 states. [2018-12-09 10:20:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:35,024 INFO L93 Difference]: Finished difference Result 56572 states and 172320 transitions. [2018-12-09 10:20:35,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 10:20:35,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-09 10:20:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:35,092 INFO L225 Difference]: With dead ends: 56572 [2018-12-09 10:20:35,093 INFO L226 Difference]: Without dead ends: 56572 [2018-12-09 10:20:35,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-09 10:20:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56572 states. [2018-12-09 10:20:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56572 to 43308. [2018-12-09 10:20:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43308 states. [2018-12-09 10:20:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43308 states to 43308 states and 134916 transitions. [2018-12-09 10:20:35,612 INFO L78 Accepts]: Start accepts. Automaton has 43308 states and 134916 transitions. Word has length 82 [2018-12-09 10:20:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:35,612 INFO L480 AbstractCegarLoop]: Abstraction has 43308 states and 134916 transitions. [2018-12-09 10:20:35,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:20:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43308 states and 134916 transitions. [2018-12-09 10:20:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 10:20:35,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:35,640 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] [2018-12-09 10:20:35,640 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:35,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash -427703382, now seen corresponding path program 1 times [2018-12-09 10:20:35,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:35,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:35,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:35,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:35,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:35,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:35,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:35,667 INFO L87 Difference]: Start difference. First operand 43308 states and 134916 transitions. Second operand 5 states. [2018-12-09 10:20:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:35,692 INFO L93 Difference]: Finished difference Result 5912 states and 15461 transitions. [2018-12-09 10:20:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:20:35,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 10:20:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:35,696 INFO L225 Difference]: With dead ends: 5912 [2018-12-09 10:20:35,696 INFO L226 Difference]: Without dead ends: 5336 [2018-12-09 10:20:35,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2018-12-09 10:20:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 5172. [2018-12-09 10:20:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5172 states. [2018-12-09 10:20:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 13581 transitions. [2018-12-09 10:20:35,735 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 13581 transitions. Word has length 82 [2018-12-09 10:20:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:35,735 INFO L480 AbstractCegarLoop]: Abstraction has 5172 states and 13581 transitions. [2018-12-09 10:20:35,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 13581 transitions. [2018-12-09 10:20:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:20:35,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:35,739 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] [2018-12-09 10:20:35,739 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:35,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1928340439, now seen corresponding path program 1 times [2018-12-09 10:20:35,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:35,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:35,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:35,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:35,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:35,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:35,770 INFO L87 Difference]: Start difference. First operand 5172 states and 13581 transitions. Second operand 5 states. [2018-12-09 10:20:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:35,904 INFO L93 Difference]: Finished difference Result 5800 states and 15082 transitions. [2018-12-09 10:20:35,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:20:35,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 10:20:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:35,909 INFO L225 Difference]: With dead ends: 5800 [2018-12-09 10:20:35,909 INFO L226 Difference]: Without dead ends: 5800 [2018-12-09 10:20:35,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2018-12-09 10:20:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5224. [2018-12-09 10:20:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-12-09 10:20:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 13693 transitions. [2018-12-09 10:20:35,945 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 13693 transitions. Word has length 94 [2018-12-09 10:20:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:35,946 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 13693 transitions. [2018-12-09 10:20:35,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 13693 transitions. [2018-12-09 10:20:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:20:35,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:35,949 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] [2018-12-09 10:20:35,950 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:35,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash -758672297, now seen corresponding path program 1 times [2018-12-09 10:20:35,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:35,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:35,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:36,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:36,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:20:36,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:36,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:20:36,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:20:36,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:36,002 INFO L87 Difference]: Start difference. First operand 5224 states and 13693 transitions. Second operand 6 states. [2018-12-09 10:20:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:36,179 INFO L93 Difference]: Finished difference Result 5505 states and 14244 transitions. [2018-12-09 10:20:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:20:36,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 10:20:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:36,183 INFO L225 Difference]: With dead ends: 5505 [2018-12-09 10:20:36,184 INFO L226 Difference]: Without dead ends: 5468 [2018-12-09 10:20:36,184 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-09 10:20:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2018-12-09 10:20:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5398. [2018-12-09 10:20:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2018-12-09 10:20:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 14044 transitions. [2018-12-09 10:20:36,221 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 14044 transitions. Word has length 94 [2018-12-09 10:20:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:36,221 INFO L480 AbstractCegarLoop]: Abstraction has 5398 states and 14044 transitions. [2018-12-09 10:20:36,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:20:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 14044 transitions. [2018-12-09 10:20:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:20:36,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:36,224 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] [2018-12-09 10:20:36,224 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:36,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 942068182, now seen corresponding path program 1 times [2018-12-09 10:20:36,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:36,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:36,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:20:36,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:36,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:20:36,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:20:36,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:36,274 INFO L87 Difference]: Start difference. First operand 5398 states and 14044 transitions. Second operand 7 states. [2018-12-09 10:20:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:36,474 INFO L93 Difference]: Finished difference Result 5642 states and 14631 transitions. [2018-12-09 10:20:36,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:20:36,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 10:20:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:36,478 INFO L225 Difference]: With dead ends: 5642 [2018-12-09 10:20:36,478 INFO L226 Difference]: Without dead ends: 5642 [2018-12-09 10:20:36,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-12-09 10:20:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5380. [2018-12-09 10:20:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5380 states. [2018-12-09 10:20:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 14007 transitions. [2018-12-09 10:20:36,517 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 14007 transitions. Word has length 94 [2018-12-09 10:20:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:36,518 INFO L480 AbstractCegarLoop]: Abstraction has 5380 states and 14007 transitions. [2018-12-09 10:20:36,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:20:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 14007 transitions. [2018-12-09 10:20:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:20:36,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:36,521 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] [2018-12-09 10:20:36,521 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1942019594, now seen corresponding path program 1 times [2018-12-09 10:20:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:36,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:36,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:36,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:36,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:36,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:36,571 INFO L87 Difference]: Start difference. First operand 5380 states and 14007 transitions. Second operand 5 states. [2018-12-09 10:20:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:36,649 INFO L93 Difference]: Finished difference Result 5380 states and 13966 transitions. [2018-12-09 10:20:36,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:20:36,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 10:20:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:36,654 INFO L225 Difference]: With dead ends: 5380 [2018-12-09 10:20:36,654 INFO L226 Difference]: Without dead ends: 5380 [2018-12-09 10:20:36,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2018-12-09 10:20:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5380. [2018-12-09 10:20:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5380 states. [2018-12-09 10:20:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 13966 transitions. [2018-12-09 10:20:36,694 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 13966 transitions. Word has length 94 [2018-12-09 10:20:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:36,694 INFO L480 AbstractCegarLoop]: Abstraction has 5380 states and 13966 transitions. [2018-12-09 10:20:36,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 13966 transitions. [2018-12-09 10:20:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:20:36,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:36,698 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] [2018-12-09 10:20:36,698 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:36,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 306211757, now seen corresponding path program 1 times [2018-12-09 10:20:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:36,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:36,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:36,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:36,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:36,734 INFO L87 Difference]: Start difference. First operand 5380 states and 13966 transitions. Second operand 5 states. [2018-12-09 10:20:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:36,842 INFO L93 Difference]: Finished difference Result 10289 states and 26976 transitions. [2018-12-09 10:20:36,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:20:36,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 10:20:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:36,849 INFO L225 Difference]: With dead ends: 10289 [2018-12-09 10:20:36,850 INFO L226 Difference]: Without dead ends: 10289 [2018-12-09 10:20:36,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10289 states. [2018-12-09 10:20:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10289 to 5436. [2018-12-09 10:20:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5436 states. [2018-12-09 10:20:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5436 states to 5436 states and 14080 transitions. [2018-12-09 10:20:36,902 INFO L78 Accepts]: Start accepts. Automaton has 5436 states and 14080 transitions. Word has length 94 [2018-12-09 10:20:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:36,902 INFO L480 AbstractCegarLoop]: Abstraction has 5436 states and 14080 transitions. [2018-12-09 10:20:36,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5436 states and 14080 transitions. [2018-12-09 10:20:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 10:20:36,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:36,905 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] [2018-12-09 10:20:36,905 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:36,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2053095252, now seen corresponding path program 1 times [2018-12-09 10:20:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:36,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:36,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:36,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:36,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:20:36,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:36,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:20:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:20:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:36,956 INFO L87 Difference]: Start difference. First operand 5436 states and 14080 transitions. Second operand 6 states. [2018-12-09 10:20:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:37,046 INFO L93 Difference]: Finished difference Result 3980 states and 9928 transitions. [2018-12-09 10:20:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:20:37,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 10:20:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:37,049 INFO L225 Difference]: With dead ends: 3980 [2018-12-09 10:20:37,049 INFO L226 Difference]: Without dead ends: 3980 [2018-12-09 10:20:37,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2018-12-09 10:20:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3058. [2018-12-09 10:20:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2018-12-09 10:20:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 7722 transitions. [2018-12-09 10:20:37,071 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 7722 transitions. Word has length 94 [2018-12-09 10:20:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:37,071 INFO L480 AbstractCegarLoop]: Abstraction has 3058 states and 7722 transitions. [2018-12-09 10:20:37,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:20:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 7722 transitions. [2018-12-09 10:20:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:20:37,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:37,073 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] [2018-12-09 10:20:37,073 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:37,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-09 10:20:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:37,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:20:37,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:37,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:20:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:20:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:20:37,133 INFO L87 Difference]: Start difference. First operand 3058 states and 7722 transitions. Second operand 8 states. [2018-12-09 10:20:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:37,666 INFO L93 Difference]: Finished difference Result 7304 states and 18572 transitions. [2018-12-09 10:20:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 10:20:37,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 10:20:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:37,676 INFO L225 Difference]: With dead ends: 7304 [2018-12-09 10:20:37,676 INFO L226 Difference]: Without dead ends: 7272 [2018-12-09 10:20:37,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-09 10:20:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-09 10:20:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 3769. [2018-12-09 10:20:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2018-12-09 10:20:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 9441 transitions. [2018-12-09 10:20:37,725 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 9441 transitions. Word has length 96 [2018-12-09 10:20:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:37,725 INFO L480 AbstractCegarLoop]: Abstraction has 3769 states and 9441 transitions. [2018-12-09 10:20:37,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:20:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 9441 transitions. [2018-12-09 10:20:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:20:37,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:37,727 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] [2018-12-09 10:20:37,727 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-09 10:20:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:37,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:37,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:37,766 INFO L87 Difference]: Start difference. First operand 3769 states and 9441 transitions. Second operand 5 states. [2018-12-09 10:20:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:37,793 INFO L93 Difference]: Finished difference Result 5639 states and 14430 transitions. [2018-12-09 10:20:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:20:37,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 10:20:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:37,797 INFO L225 Difference]: With dead ends: 5639 [2018-12-09 10:20:37,797 INFO L226 Difference]: Without dead ends: 5639 [2018-12-09 10:20:37,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:20:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2018-12-09 10:20:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3550. [2018-12-09 10:20:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-12-09 10:20:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 8942 transitions. [2018-12-09 10:20:37,828 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 8942 transitions. Word has length 96 [2018-12-09 10:20:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:37,828 INFO L480 AbstractCegarLoop]: Abstraction has 3550 states and 8942 transitions. [2018-12-09 10:20:37,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 8942 transitions. [2018-12-09 10:20:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:20:37,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:37,830 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] [2018-12-09 10:20:37,830 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:37,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-09 10:20:37,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:37,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:37,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:37,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:20:37,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:37,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:20:37,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:20:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:20:37,864 INFO L87 Difference]: Start difference. First operand 3550 states and 8942 transitions. Second operand 5 states. [2018-12-09 10:20:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:37,964 INFO L93 Difference]: Finished difference Result 3998 states and 10046 transitions. [2018-12-09 10:20:37,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:20:37,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 10:20:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:37,967 INFO L225 Difference]: With dead ends: 3998 [2018-12-09 10:20:37,967 INFO L226 Difference]: Without dead ends: 3966 [2018-12-09 10:20:37,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:20:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2018-12-09 10:20:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3046. [2018-12-09 10:20:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2018-12-09 10:20:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 7688 transitions. [2018-12-09 10:20:37,988 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 7688 transitions. Word has length 96 [2018-12-09 10:20:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:37,988 INFO L480 AbstractCegarLoop]: Abstraction has 3046 states and 7688 transitions. [2018-12-09 10:20:37,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:20:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 7688 transitions. [2018-12-09 10:20:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:20:37,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:37,990 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] [2018-12-09 10:20:37,990 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:37,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-09 10:20:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:37,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:38,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 10:20:38,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 10:20:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:20:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:20:38,065 INFO L87 Difference]: Start difference. First operand 3046 states and 7688 transitions. Second operand 10 states. [2018-12-09 10:20:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:38,455 INFO L93 Difference]: Finished difference Result 5121 states and 13059 transitions. [2018-12-09 10:20:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:20:38,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 10:20:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:38,458 INFO L225 Difference]: With dead ends: 5121 [2018-12-09 10:20:38,458 INFO L226 Difference]: Without dead ends: 2051 [2018-12-09 10:20:38,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:20:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2018-12-09 10:20:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2018-12-09 10:20:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-09 10:20:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-09 10:20:38,483 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-09 10:20:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:38,483 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-09 10:20:38,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 10:20:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-09 10:20:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:20:38,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:38,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:20:38,485 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:38,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-09 10:20:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:20:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:38,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:20:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:20:38,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:20:38,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 10:20:38,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:20:38,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 10:20:38,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:20:38,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:20:38,596 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-09 10:20:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:20:38,942 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-09 10:20:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 10:20:38,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-09 10:20:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:20:38,944 INFO L225 Difference]: With dead ends: 3882 [2018-12-09 10:20:38,944 INFO L226 Difference]: Without dead ends: 2746 [2018-12-09 10:20:38,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 10:20:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-09 10:20:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-09 10:20:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-09 10:20:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-09 10:20:38,961 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-09 10:20:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:20:38,961 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-09 10:20:38,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 10:20:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-09 10:20:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 10:20:38,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:20:38,963 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] [2018-12-09 10:20:38,963 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:20:38,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:20:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-09 10:20:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:20:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:38,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:20:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:20:38,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:20:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:20:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:20:38,997 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:20:39,080 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:20:39,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:20:39 BasicIcfg [2018-12-09 10:20:39,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:20:39,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:20:39,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:20:39,082 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:20:39,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:19:58" (3/4) ... [2018-12-09 10:20:39,085 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:20:39,170 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f315d49c-7216-4b8e-a90c-10d61f9a5b2d/bin-2019/utaipan/witness.graphml [2018-12-09 10:20:39,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:20:39,171 INFO L168 Benchmark]: Toolchain (without parser) took 41835.84 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 947.0 MB in the beginning and 998.6 MB in the end (delta: -51.6 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-09 10:20:39,172 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:20:39,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:20:39,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:20:39,173 INFO L168 Benchmark]: Boogie Preprocessor took 17.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:20:39,173 INFO L168 Benchmark]: RCFGBuilder took 324.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:20:39,173 INFO L168 Benchmark]: TraceAbstraction took 41046.05 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 998.6 MB in the end (delta: 39.6 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-09 10:20:39,174 INFO L168 Benchmark]: Witness Printer took 88.30 ms. Allocated memory is still 4.5 GB. Free memory is still 998.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:20:39,175 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41046.05 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 998.6 MB in the end (delta: 39.6 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 88.30 ms. Allocated memory is still 4.5 GB. Free memory is still 998.6 MB. There was no memory consumed. 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1609; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1610; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 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 [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -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) [L786] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -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)) [L787] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -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)) [L788] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -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)) [L789] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -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)) [L790] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -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)) [L791] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -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)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 40.9s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11264 SDtfs, 13179 SDslu, 31150 SDs, 0 SdLazy, 15397 SolverSat, 818 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 117 SyntacticMatches, 25 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111954occurred in iteration=12, 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: 18.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 392425 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2863 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2731 ConstructedInterpolants, 0 QuantifiedInterpolants, 513997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...