./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_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_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/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 2704334a5f5c65f6107547c60b5bde5e46cdf374 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-03 02:40:39,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:40:39,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:40:39,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:40:39,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:40:39,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:40:39,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:40:39,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:40:39,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:40:39,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:40:39,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:40:39,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:40:39,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:40:39,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:40:39,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:40:39,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:40:39,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:40:39,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:40:39,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:40:39,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:40:39,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:40:39,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:40:39,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:40:39,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:40:39,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:40:39,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:40:39,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:40:39,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:40:39,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:40:39,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:40:39,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:40:39,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:40:39,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:40:39,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:40:39,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:40:39,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:40:39,722 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:40:39,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:40:39,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:40:39,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:40:39,730 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:40:39,730 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:40:39,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:40:39,730 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:40:39,730 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:40:39,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:40:39,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:40:39,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:40:39,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:40:39,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:40:39,733 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:40:39,733 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_19b04fcc-da32-414b-92f2-111b0e88ef88/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 -> 2704334a5f5c65f6107547c60b5bde5e46cdf374 [2018-12-03 02:40:39,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:40:39,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:40:39,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:40:39,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:40:39,759 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:40:39,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2018-12-03 02:40:39,797 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/data/6803c7fcc/975ef318b3a3434e855272748b4dfd8c/FLAG7f2a5ce9c [2018-12-03 02:40:40,243 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:40:40,243 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2018-12-03 02:40:40,250 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/data/6803c7fcc/975ef318b3a3434e855272748b4dfd8c/FLAG7f2a5ce9c [2018-12-03 02:40:40,258 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/data/6803c7fcc/975ef318b3a3434e855272748b4dfd8c [2018-12-03 02:40:40,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:40:40,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:40:40,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:40:40,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:40:40,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:40:40,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40, skipping insertion in model container [2018-12-03 02:40:40,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:40:40,301 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:40:40,511 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:40:40,521 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:40:40,610 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:40:40,641 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:40:40,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40 WrapperNode [2018-12-03 02:40:40,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:40:40,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:40:40,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:40:40,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:40:40,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:40:40,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:40:40,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:40:40,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:40:40,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... [2018-12-03 02:40:40,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:40:40,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:40:40,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:40:40,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:40:40,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/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-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 02:40:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 02:40:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 02:40:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:40:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:40:40,728 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 02:40:41,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:40:41,035 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 02:40:41,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:40:41 BoogieIcfgContainer [2018-12-03 02:40:41,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:40:41,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:40:41,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:40:41,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:40:41,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:40:40" (1/3) ... [2018-12-03 02:40:41,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400413f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:40:41, skipping insertion in model container [2018-12-03 02:40:41,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:40:40" (2/3) ... [2018-12-03 02:40:41,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6400413f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:40:41, skipping insertion in model container [2018-12-03 02:40:41,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:40:41" (3/3) ... [2018-12-03 02:40:41,040 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt_false-unreach-call.i [2018-12-03 02:40:41,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,062 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,063 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,066 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:40:41,074 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 02:40:41,074 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:40:41,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 02:40:41,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 02:40:41,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:40:41,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:40:41,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:40:41,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:40:41,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:40:41,109 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:40:41,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:40:41,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:40:41,116 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-03 02:40:42,012 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2018-12-03 02:40:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2018-12-03 02:40:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 02:40:42,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:42,020 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] [2018-12-03 02:40:42,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:42,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2018-12-03 02:40:42,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:42,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:42,161 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-03 02:40:42,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:40:42,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:42,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:40:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:40:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:42,175 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2018-12-03 02:40:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:42,531 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2018-12-03 02:40:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:40:42,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-03 02:40:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:42,677 INFO L225 Difference]: With dead ends: 45386 [2018-12-03 02:40:42,677 INFO L226 Difference]: Without dead ends: 40626 [2018-12-03 02:40:42,679 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-03 02:40:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2018-12-03 02:40:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2018-12-03 02:40:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2018-12-03 02:40:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2018-12-03 02:40:43,344 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2018-12-03 02:40:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:43,345 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2018-12-03 02:40:43,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:40:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2018-12-03 02:40:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 02:40:43,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:43,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:40:43,348 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:43,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash 435483284, now seen corresponding path program 1 times [2018-12-03 02:40:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:43,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:43,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:43,404 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-03 02:40:43,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:43,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:43,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:43,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:43,406 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2018-12-03 02:40:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:44,001 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2018-12-03 02:40:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:40:44,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-03 02:40:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:44,162 INFO L225 Difference]: With dead ends: 64828 [2018-12-03 02:40:44,162 INFO L226 Difference]: Without dead ends: 64668 [2018-12-03 02:40:44,163 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-03 02:40:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2018-12-03 02:40:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2018-12-03 02:40:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2018-12-03 02:40:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2018-12-03 02:40:44,991 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2018-12-03 02:40:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:44,992 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2018-12-03 02:40:44,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2018-12-03 02:40:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 02:40:44,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:44,994 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] [2018-12-03 02:40:44,994 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:44,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2018-12-03 02:40:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:44,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:45,038 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-03 02:40:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:45,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:40:45,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:45,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:40:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:40:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:45,039 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2018-12-03 02:40:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:45,078 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2018-12-03 02:40:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:40:45,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-03 02:40:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:45,094 INFO L225 Difference]: With dead ends: 12362 [2018-12-03 02:40:45,094 INFO L226 Difference]: Without dead ends: 11841 [2018-12-03 02:40:45,094 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-03 02:40:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2018-12-03 02:40:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2018-12-03 02:40:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2018-12-03 02:40:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2018-12-03 02:40:45,322 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2018-12-03 02:40:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:45,322 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2018-12-03 02:40:45,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:40:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2018-12-03 02:40:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:40:45,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:45,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] [2018-12-03 02:40:45,325 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:45,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1477280175, now seen corresponding path program 1 times [2018-12-03 02:40:45,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:45,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:45,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:45,368 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-03 02:40:45,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:40:45,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:45,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:40:45,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:40:45,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:45,369 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2018-12-03 02:40:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:45,530 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2018-12-03 02:40:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:40:45,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 02:40:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:45,553 INFO L225 Difference]: With dead ends: 17017 [2018-12-03 02:40:45,554 INFO L226 Difference]: Without dead ends: 17017 [2018-12-03 02:40:45,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2018-12-03 02:40:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2018-12-03 02:40:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2018-12-03 02:40:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2018-12-03 02:40:45,713 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2018-12-03 02:40:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:45,713 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2018-12-03 02:40:45,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:40:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2018-12-03 02:40:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:40:45,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:45,718 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] [2018-12-03 02:40:45,718 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:45,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1182034221, now seen corresponding path program 1 times [2018-12-03 02:40:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:45,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:45,768 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-03 02:40:45,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:45,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:45,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:45,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:45,769 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 5 states. [2018-12-03 02:40:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:45,792 INFO L93 Difference]: Finished difference Result 2521 states and 6735 transitions. [2018-12-03 02:40:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:40:45,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-03 02:40:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:45,794 INFO L225 Difference]: With dead ends: 2521 [2018-12-03 02:40:45,795 INFO L226 Difference]: Without dead ends: 2109 [2018-12-03 02:40:45,795 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-03 02:40:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2018-12-03 02:40:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2006. [2018-12-03 02:40:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2018-12-03 02:40:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 5338 transitions. [2018-12-03 02:40:45,809 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 5338 transitions. Word has length 56 [2018-12-03 02:40:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:45,809 INFO L480 AbstractCegarLoop]: Abstraction has 2006 states and 5338 transitions. [2018-12-03 02:40:45,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 5338 transitions. [2018-12-03 02:40:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:40:45,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:45,811 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] [2018-12-03 02:40:45,812 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:45,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:45,812 INFO L82 PathProgramCache]: Analyzing trace with hash 318545353, now seen corresponding path program 1 times [2018-12-03 02:40:45,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:40:45,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:40:45,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:45,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:40:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:40:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:40:45,845 INFO L87 Difference]: Start difference. First operand 2006 states and 5338 transitions. Second operand 3 states. [2018-12-03 02:40:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:45,913 INFO L93 Difference]: Finished difference Result 2090 states and 5527 transitions. [2018-12-03 02:40:45,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:40:45,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-03 02:40:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:45,915 INFO L225 Difference]: With dead ends: 2090 [2018-12-03 02:40:45,915 INFO L226 Difference]: Without dead ends: 2090 [2018-12-03 02:40:45,915 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-03 02:40:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-12-03 02:40:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2044. [2018-12-03 02:40:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-12-03 02:40:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 5424 transitions. [2018-12-03 02:40:45,929 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 5424 transitions. Word has length 89 [2018-12-03 02:40:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:45,929 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 5424 transitions. [2018-12-03 02:40:45,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:40:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 5424 transitions. [2018-12-03 02:40:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:40:45,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:45,931 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] [2018-12-03 02:40:45,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:45,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1894805112, now seen corresponding path program 1 times [2018-12-03 02:40:45,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:45,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:45,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:40:45,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:40:45,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:45,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:40:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:40:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:45,962 INFO L87 Difference]: Start difference. First operand 2044 states and 5424 transitions. Second operand 4 states. [2018-12-03 02:40:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:46,097 INFO L93 Difference]: Finished difference Result 3189 states and 8505 transitions. [2018-12-03 02:40:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:40:46,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-03 02:40:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:46,099 INFO L225 Difference]: With dead ends: 3189 [2018-12-03 02:40:46,100 INFO L226 Difference]: Without dead ends: 3189 [2018-12-03 02:40:46,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2018-12-03 02:40:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2084. [2018-12-03 02:40:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2018-12-03 02:40:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 5514 transitions. [2018-12-03 02:40:46,118 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 5514 transitions. Word has length 89 [2018-12-03 02:40:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:46,118 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 5514 transitions. [2018-12-03 02:40:46,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:40:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 5514 transitions. [2018-12-03 02:40:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:40:46,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:46,120 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] [2018-12-03 02:40:46,120 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:46,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1714371072, now seen corresponding path program 2 times [2018-12-03 02:40:46,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:46,149 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-03 02:40:46,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:46,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:46,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:46,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:46,150 INFO L87 Difference]: Start difference. First operand 2084 states and 5514 transitions. Second operand 5 states. [2018-12-03 02:40:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:46,261 INFO L93 Difference]: Finished difference Result 2972 states and 7652 transitions. [2018-12-03 02:40:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:40:46,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-03 02:40:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:46,264 INFO L225 Difference]: With dead ends: 2972 [2018-12-03 02:40:46,264 INFO L226 Difference]: Without dead ends: 2972 [2018-12-03 02:40:46,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:40:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-12-03 02:40:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2208. [2018-12-03 02:40:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2018-12-03 02:40:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 5829 transitions. [2018-12-03 02:40:46,283 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 5829 transitions. Word has length 89 [2018-12-03 02:40:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:46,284 INFO L480 AbstractCegarLoop]: Abstraction has 2208 states and 5829 transitions. [2018-12-03 02:40:46,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 5829 transitions. [2018-12-03 02:40:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:40:46,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:46,286 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] [2018-12-03 02:40:46,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:46,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:46,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1904549666, now seen corresponding path program 3 times [2018-12-03 02:40:46,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:46,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:40:46,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:46,334 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-03 02:40:46,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:46,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:40:46,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:46,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:40:46,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:40:46,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:40:46,335 INFO L87 Difference]: Start difference. First operand 2208 states and 5829 transitions. Second operand 7 states. [2018-12-03 02:40:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:46,652 INFO L93 Difference]: Finished difference Result 2942 states and 7549 transitions. [2018-12-03 02:40:46,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:40:46,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 02:40:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:46,654 INFO L225 Difference]: With dead ends: 2942 [2018-12-03 02:40:46,654 INFO L226 Difference]: Without dead ends: 2896 [2018-12-03 02:40:46,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:40:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2018-12-03 02:40:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2389. [2018-12-03 02:40:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2018-12-03 02:40:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 6245 transitions. [2018-12-03 02:40:46,673 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 6245 transitions. Word has length 89 [2018-12-03 02:40:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:46,673 INFO L480 AbstractCegarLoop]: Abstraction has 2389 states and 6245 transitions. [2018-12-03 02:40:46,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:40:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 6245 transitions. [2018-12-03 02:40:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:40:46,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:46,675 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] [2018-12-03 02:40:46,675 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:46,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash 66389791, now seen corresponding path program 1 times [2018-12-03 02:40:46,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:40:46,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:46,724 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-03 02:40:46,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:46,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:46,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:46,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:46,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:46,725 INFO L87 Difference]: Start difference. First operand 2389 states and 6245 transitions. Second operand 5 states. [2018-12-03 02:40:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:46,851 INFO L93 Difference]: Finished difference Result 3274 states and 8297 transitions. [2018-12-03 02:40:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:40:46,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-03 02:40:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:46,853 INFO L225 Difference]: With dead ends: 3274 [2018-12-03 02:40:46,853 INFO L226 Difference]: Without dead ends: 3210 [2018-12-03 02:40:46,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:40:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2018-12-03 02:40:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2424. [2018-12-03 02:40:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2018-12-03 02:40:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 6308 transitions. [2018-12-03 02:40:46,872 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 6308 transitions. Word has length 89 [2018-12-03 02:40:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:46,873 INFO L480 AbstractCegarLoop]: Abstraction has 2424 states and 6308 transitions. [2018-12-03 02:40:46,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 6308 transitions. [2018-12-03 02:40:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:46,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:46,875 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] [2018-12-03 02:40:46,875 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:46,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1433627711, now seen corresponding path program 1 times [2018-12-03 02:40:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:46,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:46,905 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-03 02:40:46,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:46,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:46,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:46,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:46,906 INFO L87 Difference]: Start difference. First operand 2424 states and 6308 transitions. Second operand 5 states. [2018-12-03 02:40:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:47,079 INFO L93 Difference]: Finished difference Result 5336 states and 14263 transitions. [2018-12-03 02:40:47,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:40:47,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 02:40:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:47,086 INFO L225 Difference]: With dead ends: 5336 [2018-12-03 02:40:47,086 INFO L226 Difference]: Without dead ends: 5287 [2018-12-03 02:40:47,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2018-12-03 02:40:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 2195. [2018-12-03 02:40:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-12-03 02:40:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 5666 transitions. [2018-12-03 02:40:47,155 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 5666 transitions. Word has length 91 [2018-12-03 02:40:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:47,155 INFO L480 AbstractCegarLoop]: Abstraction has 2195 states and 5666 transitions. [2018-12-03 02:40:47,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 5666 transitions. [2018-12-03 02:40:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:47,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:47,157 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] [2018-12-03 02:40:47,157 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:47,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash 510944128, now seen corresponding path program 1 times [2018-12-03 02:40:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:47,244 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-03 02:40:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:47,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:40:47,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:47,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:40:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:40:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:40:47,245 INFO L87 Difference]: Start difference. First operand 2195 states and 5666 transitions. Second operand 6 states. [2018-12-03 02:40:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:47,367 INFO L93 Difference]: Finished difference Result 2441 states and 6198 transitions. [2018-12-03 02:40:47,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:40:47,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 02:40:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:47,369 INFO L225 Difference]: With dead ends: 2441 [2018-12-03 02:40:47,369 INFO L226 Difference]: Without dead ends: 2441 [2018-12-03 02:40:47,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:40:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-12-03 02:40:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2086. [2018-12-03 02:40:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2018-12-03 02:40:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 5380 transitions. [2018-12-03 02:40:47,387 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 5380 transitions. Word has length 91 [2018-12-03 02:40:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:47,387 INFO L480 AbstractCegarLoop]: Abstraction has 2086 states and 5380 transitions. [2018-12-03 02:40:47,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:40:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 5380 transitions. [2018-12-03 02:40:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:47,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:47,390 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] [2018-12-03 02:40:47,390 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:47,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1275259263, now seen corresponding path program 1 times [2018-12-03 02:40:47,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:47,451 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-03 02:40:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:40:47,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:47,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:40:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:40:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:47,452 INFO L87 Difference]: Start difference. First operand 2086 states and 5380 transitions. Second operand 4 states. [2018-12-03 02:40:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:47,512 INFO L93 Difference]: Finished difference Result 2422 states and 6300 transitions. [2018-12-03 02:40:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:40:47,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-03 02:40:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:47,514 INFO L225 Difference]: With dead ends: 2422 [2018-12-03 02:40:47,514 INFO L226 Difference]: Without dead ends: 2422 [2018-12-03 02:40:47,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:40:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-12-03 02:40:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2390. [2018-12-03 02:40:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2018-12-03 02:40:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 6220 transitions. [2018-12-03 02:40:47,530 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 6220 transitions. Word has length 91 [2018-12-03 02:40:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:47,530 INFO L480 AbstractCegarLoop]: Abstraction has 2390 states and 6220 transitions. [2018-12-03 02:40:47,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:40:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 6220 transitions. [2018-12-03 02:40:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:47,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:47,532 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] [2018-12-03 02:40:47,532 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:47,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash 942498690, now seen corresponding path program 1 times [2018-12-03 02:40:47,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:47,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:47,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:47,608 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-03 02:40:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:40:47,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:47,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:40:47,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:40:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:40:47,609 INFO L87 Difference]: Start difference. First operand 2390 states and 6220 transitions. Second operand 7 states. [2018-12-03 02:40:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:47,819 INFO L93 Difference]: Finished difference Result 3910 states and 9984 transitions. [2018-12-03 02:40:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:40:47,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 02:40:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:47,823 INFO L225 Difference]: With dead ends: 3910 [2018-12-03 02:40:47,823 INFO L226 Difference]: Without dead ends: 3878 [2018-12-03 02:40:47,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:40:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2018-12-03 02:40:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3254. [2018-12-03 02:40:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2018-12-03 02:40:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 8389 transitions. [2018-12-03 02:40:47,850 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 8389 transitions. Word has length 91 [2018-12-03 02:40:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:47,851 INFO L480 AbstractCegarLoop]: Abstraction has 3254 states and 8389 transitions. [2018-12-03 02:40:47,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:40:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 8389 transitions. [2018-12-03 02:40:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:47,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:47,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:40:47,854 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:47,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1904112707, now seen corresponding path program 1 times [2018-12-03 02:40:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:47,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:40:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:47,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:40:47,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:47,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:40:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:40:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:40:47,920 INFO L87 Difference]: Start difference. First operand 3254 states and 8389 transitions. Second operand 7 states. [2018-12-03 02:40:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:48,115 INFO L93 Difference]: Finished difference Result 4497 states and 11477 transitions. [2018-12-03 02:40:48,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:40:48,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 02:40:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:48,119 INFO L225 Difference]: With dead ends: 4497 [2018-12-03 02:40:48,119 INFO L226 Difference]: Without dead ends: 4497 [2018-12-03 02:40:48,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:40:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2018-12-03 02:40:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 3718. [2018-12-03 02:40:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2018-12-03 02:40:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 9631 transitions. [2018-12-03 02:40:48,147 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 9631 transitions. Word has length 91 [2018-12-03 02:40:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:48,147 INFO L480 AbstractCegarLoop]: Abstraction has 3718 states and 9631 transitions. [2018-12-03 02:40:48,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:40:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 9631 transitions. [2018-12-03 02:40:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:48,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:48,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:40:48,150 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:48,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1146090108, now seen corresponding path program 1 times [2018-12-03 02:40:48,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:48,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:48,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:48,210 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-03 02:40:48,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:48,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:40:48,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:48,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:40:48,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:40:48,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:40:48,211 INFO L87 Difference]: Start difference. First operand 3718 states and 9631 transitions. Second operand 6 states. [2018-12-03 02:40:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:48,341 INFO L93 Difference]: Finished difference Result 4467 states and 11566 transitions. [2018-12-03 02:40:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:40:48,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 02:40:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:48,345 INFO L225 Difference]: With dead ends: 4467 [2018-12-03 02:40:48,345 INFO L226 Difference]: Without dead ends: 4467 [2018-12-03 02:40:48,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:40:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2018-12-03 02:40:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3597. [2018-12-03 02:40:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-03 02:40:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9312 transitions. [2018-12-03 02:40:48,371 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9312 transitions. Word has length 91 [2018-12-03 02:40:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:48,371 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9312 transitions. [2018-12-03 02:40:48,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:40:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9312 transitions. [2018-12-03 02:40:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:48,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:48,374 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] [2018-12-03 02:40:48,374 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:48,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash 682115181, now seen corresponding path program 1 times [2018-12-03 02:40:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:48,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:48,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:48,455 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-03 02:40:48,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:48,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:40:48,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:48,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:40:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:40:48,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:40:48,456 INFO L87 Difference]: Start difference. First operand 3597 states and 9312 transitions. Second operand 7 states. [2018-12-03 02:40:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:48,653 INFO L93 Difference]: Finished difference Result 3854 states and 9924 transitions. [2018-12-03 02:40:48,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:40:48,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 02:40:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:48,657 INFO L225 Difference]: With dead ends: 3854 [2018-12-03 02:40:48,657 INFO L226 Difference]: Without dead ends: 3854 [2018-12-03 02:40:48,657 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-03 02:40:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2018-12-03 02:40:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3595. [2018-12-03 02:40:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2018-12-03 02:40:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 9299 transitions. [2018-12-03 02:40:48,686 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 9299 transitions. Word has length 91 [2018-12-03 02:40:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:48,687 INFO L480 AbstractCegarLoop]: Abstraction has 3595 states and 9299 transitions. [2018-12-03 02:40:48,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:40:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 9299 transitions. [2018-12-03 02:40:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:48,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:48,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:40:48,690 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:48,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1587356682, now seen corresponding path program 1 times [2018-12-03 02:40:48,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:48,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:48,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:48,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:48,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:48,795 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-03 02:40:48,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:48,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:40:48,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:48,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:40:48,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:40:48,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:40:48,796 INFO L87 Difference]: Start difference. First operand 3595 states and 9299 transitions. Second operand 8 states. [2018-12-03 02:40:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:49,034 INFO L93 Difference]: Finished difference Result 4253 states and 10835 transitions. [2018-12-03 02:40:49,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:40:49,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-12-03 02:40:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:49,038 INFO L225 Difference]: With dead ends: 4253 [2018-12-03 02:40:49,038 INFO L226 Difference]: Without dead ends: 4221 [2018-12-03 02:40:49,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:40:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2018-12-03 02:40:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 3128. [2018-12-03 02:40:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2018-12-03 02:40:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 8019 transitions. [2018-12-03 02:40:49,063 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 8019 transitions. Word has length 91 [2018-12-03 02:40:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:49,063 INFO L480 AbstractCegarLoop]: Abstraction has 3128 states and 8019 transitions. [2018-12-03 02:40:49,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:40:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 8019 transitions. [2018-12-03 02:40:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:49,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:49,067 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] [2018-12-03 02:40:49,067 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:49,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -501232116, now seen corresponding path program 1 times [2018-12-03 02:40:49,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:49,123 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-03 02:40:49,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:49,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:49,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:49,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:49,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:49,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:49,123 INFO L87 Difference]: Start difference. First operand 3128 states and 8019 transitions. Second operand 5 states. [2018-12-03 02:40:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:49,145 INFO L93 Difference]: Finished difference Result 5011 states and 13104 transitions. [2018-12-03 02:40:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:40:49,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 02:40:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:49,149 INFO L225 Difference]: With dead ends: 5011 [2018-12-03 02:40:49,149 INFO L226 Difference]: Without dead ends: 5011 [2018-12-03 02:40:49,150 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-03 02:40:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2018-12-03 02:40:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 2856. [2018-12-03 02:40:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-12-03 02:40:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 7248 transitions. [2018-12-03 02:40:49,192 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 7248 transitions. Word has length 91 [2018-12-03 02:40:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:49,192 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 7248 transitions. [2018-12-03 02:40:49,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 7248 transitions. [2018-12-03 02:40:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:40:49,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:49,194 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] [2018-12-03 02:40:49,194 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:49,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash -20515700, now seen corresponding path program 1 times [2018-12-03 02:40:49,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:49,246 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-03 02:40:49,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:49,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:40:49,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:49,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:40:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:40:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:40:49,248 INFO L87 Difference]: Start difference. First operand 2856 states and 7248 transitions. Second operand 6 states. [2018-12-03 02:40:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:49,343 INFO L93 Difference]: Finished difference Result 2504 states and 6208 transitions. [2018-12-03 02:40:49,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:40:49,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 02:40:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:49,345 INFO L225 Difference]: With dead ends: 2504 [2018-12-03 02:40:49,345 INFO L226 Difference]: Without dead ends: 2504 [2018-12-03 02:40:49,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:40:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2018-12-03 02:40:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2025. [2018-12-03 02:40:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2018-12-03 02:40:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5113 transitions. [2018-12-03 02:40:49,360 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5113 transitions. Word has length 91 [2018-12-03 02:40:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:49,360 INFO L480 AbstractCegarLoop]: Abstraction has 2025 states and 5113 transitions. [2018-12-03 02:40:49,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:40:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5113 transitions. [2018-12-03 02:40:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:40:49,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:49,361 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] [2018-12-03 02:40:49,362 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:49,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2074225848, now seen corresponding path program 1 times [2018-12-03 02:40:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:49,423 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-03 02:40:49,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:49,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:40:49,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:49,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:40:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:40:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:40:49,424 INFO L87 Difference]: Start difference. First operand 2025 states and 5113 transitions. Second operand 8 states. [2018-12-03 02:40:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:49,708 INFO L93 Difference]: Finished difference Result 2916 states and 7221 transitions. [2018-12-03 02:40:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:40:49,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-03 02:40:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:49,710 INFO L225 Difference]: With dead ends: 2916 [2018-12-03 02:40:49,711 INFO L226 Difference]: Without dead ends: 2916 [2018-12-03 02:40:49,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:40:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2018-12-03 02:40:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2341. [2018-12-03 02:40:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2018-12-03 02:40:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5888 transitions. [2018-12-03 02:40:49,727 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5888 transitions. Word has length 93 [2018-12-03 02:40:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:49,728 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 5888 transitions. [2018-12-03 02:40:49,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:40:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5888 transitions. [2018-12-03 02:40:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:40:49,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:49,729 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] [2018-12-03 02:40:49,730 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:49,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash -829461367, now seen corresponding path program 1 times [2018-12-03 02:40:49,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:49,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:49,784 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-03 02:40:49,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:49,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:40:49,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:49,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:40:49,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:40:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:40:49,786 INFO L87 Difference]: Start difference. First operand 2341 states and 5888 transitions. Second operand 6 states. [2018-12-03 02:40:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:49,856 INFO L93 Difference]: Finished difference Result 2470 states and 6124 transitions. [2018-12-03 02:40:49,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:40:49,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-03 02:40:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:49,858 INFO L225 Difference]: With dead ends: 2470 [2018-12-03 02:40:49,858 INFO L226 Difference]: Without dead ends: 2450 [2018-12-03 02:40:49,858 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-03 02:40:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2018-12-03 02:40:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2275. [2018-12-03 02:40:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2018-12-03 02:40:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 5753 transitions. [2018-12-03 02:40:49,873 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 5753 transitions. Word has length 93 [2018-12-03 02:40:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:49,873 INFO L480 AbstractCegarLoop]: Abstraction has 2275 states and 5753 transitions. [2018-12-03 02:40:49,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:40:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 5753 transitions. [2018-12-03 02:40:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:40:49,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:49,875 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] [2018-12-03 02:40:49,875 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:49,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1278158006, now seen corresponding path program 1 times [2018-12-03 02:40:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:49,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:49,933 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-03 02:40:49,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:49,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:40:49,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:49,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:40:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:40:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:40:49,934 INFO L87 Difference]: Start difference. First operand 2275 states and 5753 transitions. Second operand 6 states. [2018-12-03 02:40:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:50,035 INFO L93 Difference]: Finished difference Result 2065 states and 5170 transitions. [2018-12-03 02:40:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:40:50,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-03 02:40:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:50,037 INFO L225 Difference]: With dead ends: 2065 [2018-12-03 02:40:50,037 INFO L226 Difference]: Without dead ends: 2065 [2018-12-03 02:40:50,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:40:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2018-12-03 02:40:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1995. [2018-12-03 02:40:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-12-03 02:40:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 5037 transitions. [2018-12-03 02:40:50,051 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 5037 transitions. Word has length 93 [2018-12-03 02:40:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:50,051 INFO L480 AbstractCegarLoop]: Abstraction has 1995 states and 5037 transitions. [2018-12-03 02:40:50,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:40:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 5037 transitions. [2018-12-03 02:40:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:40:50,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:50,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:40:50,053 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:50,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash 849361226, now seen corresponding path program 1 times [2018-12-03 02:40:50,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:50,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:40:50,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:50,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:40:50,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:50,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:40:50,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:40:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:40:50,103 INFO L87 Difference]: Start difference. First operand 1995 states and 5037 transitions. Second operand 5 states. [2018-12-03 02:40:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:50,210 INFO L93 Difference]: Finished difference Result 2315 states and 5837 transitions. [2018-12-03 02:40:50,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:40:50,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-03 02:40:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:50,212 INFO L225 Difference]: With dead ends: 2315 [2018-12-03 02:40:50,212 INFO L226 Difference]: Without dead ends: 2315 [2018-12-03 02:40:50,212 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-03 02:40:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2018-12-03 02:40:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2043. [2018-12-03 02:40:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2018-12-03 02:40:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 5157 transitions. [2018-12-03 02:40:50,229 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 5157 transitions. Word has length 93 [2018-12-03 02:40:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:50,229 INFO L480 AbstractCegarLoop]: Abstraction has 2043 states and 5157 transitions. [2018-12-03 02:40:50,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:40:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 5157 transitions. [2018-12-03 02:40:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:40:50,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:50,231 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] [2018-12-03 02:40:50,231 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:50,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 1 times [2018-12-03 02:40:50,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:50,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:50,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:50,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:50,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:40:50,335 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-03 02:40:50,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:40:50,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:40:50,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:40:50,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:40:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:40:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:40:50,336 INFO L87 Difference]: Start difference. First operand 2043 states and 5157 transitions. Second operand 12 states. [2018-12-03 02:40:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:40:50,673 INFO L93 Difference]: Finished difference Result 3696 states and 9496 transitions. [2018-12-03 02:40:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 02:40:50,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-03 02:40:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:40:50,675 INFO L225 Difference]: With dead ends: 3696 [2018-12-03 02:40:50,675 INFO L226 Difference]: Without dead ends: 2720 [2018-12-03 02:40:50,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-03 02:40:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-12-03 02:40:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2512. [2018-12-03 02:40:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2018-12-03 02:40:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 6216 transitions. [2018-12-03 02:40:50,691 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 6216 transitions. Word has length 93 [2018-12-03 02:40:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:40:50,691 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 6216 transitions. [2018-12-03 02:40:50,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:40:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 6216 transitions. [2018-12-03 02:40:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:40:50,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:40:50,693 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] [2018-12-03 02:40:50,693 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:40:50,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:40:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 211591505, now seen corresponding path program 2 times [2018-12-03 02:40:50,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:40:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:40:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:40:50,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:40:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:40:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:40:50,741 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:40:50,828 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 02:40:50,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:40:50 BasicIcfg [2018-12-03 02:40:50,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:40:50,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:40:50,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:40:50,830 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:40:50,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:40:41" (3/4) ... [2018-12-03 02:40:50,833 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 02:40:50,925 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_19b04fcc-da32-414b-92f2-111b0e88ef88/bin-2019/utaipan/witness.graphml [2018-12-03 02:40:50,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:40:50,926 INFO L168 Benchmark]: Toolchain (without parser) took 10665.96 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 948.1 MB in the beginning and 1.3 GB in the end (delta: -337.4 MB). Peak memory consumption was 869.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:40:50,927 INFO L168 Benchmark]: CDTParser took 0.11 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-03 02:40:50,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:40:50,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:40:50,928 INFO L168 Benchmark]: Boogie Preprocessor took 18.65 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-03 02:40:50,928 INFO L168 Benchmark]: RCFGBuilder took 342.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:40:50,928 INFO L168 Benchmark]: TraceAbstraction took 9793.58 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.1 MB). Peak memory consumption was 822.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:40:50,929 INFO L168 Benchmark]: Witness Printer took 95.33 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:40:50,930 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.11 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 380.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.65 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 342.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9793.58 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.1 MB). Peak memory consumption was 822.4 MB. Max. memory is 11.5 GB. * Witness Printer took 95.33 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2482; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 9.7s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5227 SDtfs, 4872 SDslu, 12246 SDs, 0 SdLazy, 4899 SolverSat, 320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37140occurred in iteration=2, 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: 2.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 62983 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2145 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2027 ConstructedInterpolants, 0 QuantifiedInterpolants, 443837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...