./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/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 310137b68016bca6db925b36630c05d75ac56ea2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:28:54,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:28:54,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:28:54,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:28:54,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:28:54,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:28:54,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:28:54,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:28:54,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:28:54,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:28:54,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:28:54,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:28:54,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:28:54,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:28:54,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:28:54,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:28:54,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:28:54,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:28:54,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:28:54,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:28:54,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:28:54,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:28:54,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:28:54,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:28:54,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:28:54,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:28:54,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:28:54,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:28:54,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:28:54,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:28:54,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:28:54,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:28:54,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:28:54,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:28:54,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:28:54,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:28:54,413 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:28:54,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:28:54,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:28:54,421 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:28:54,422 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:28:54,422 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:28:54,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:28:54,423 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:28:54,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:28:54,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:28:54,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:28:54,425 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:28:54,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:28:54,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:28:54,425 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:28:54,425 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_0b45219a-9414-44f6-8381-b81d0313638a/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 -> 310137b68016bca6db925b36630c05d75ac56ea2 [2018-12-09 09:28:54,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:28:54,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:28:54,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:28:54,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:28:54,455 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:28:54,456 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i [2018-12-09 09:28:54,499 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/data/2c3023cc0/5c198a6717cb443ab4785168710d2bf4/FLAGdb09e4e73 [2018-12-09 09:28:54,921 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:28:54,922 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_false-unreach-call.i [2018-12-09 09:28:54,928 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/data/2c3023cc0/5c198a6717cb443ab4785168710d2bf4/FLAGdb09e4e73 [2018-12-09 09:28:54,936 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/data/2c3023cc0/5c198a6717cb443ab4785168710d2bf4 [2018-12-09 09:28:54,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:28:54,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:28:54,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:28:54,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:28:54,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:28:54,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:28:54" (1/1) ... [2018-12-09 09:28:54,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:54, skipping insertion in model container [2018-12-09 09:28:54,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:28:54" (1/1) ... [2018-12-09 09:28:54,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:28:54,967 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:28:55,139 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:28:55,147 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:28:55,225 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:28:55,255 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:28:55,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55 WrapperNode [2018-12-09 09:28:55,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:28:55,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:28:55,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:28:55,256 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:28:55,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:28:55,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:28:55,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:28:55,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:28:55,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... [2018-12-09 09:28:55,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:28:55,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:28:55,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:28:55,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:28:55,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:28:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 09:28:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 09:28:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 09:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:28:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:28:55,344 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 09:28:55,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:28:55,641 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 09:28:55,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:28:55 BoogieIcfgContainer [2018-12-09 09:28:55,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:28:55,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:28:55,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:28:55,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:28:55,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:28:54" (1/3) ... [2018-12-09 09:28:55,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3792348f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:28:55, skipping insertion in model container [2018-12-09 09:28:55,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:28:55" (2/3) ... [2018-12-09 09:28:55,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3792348f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:28:55, skipping insertion in model container [2018-12-09 09:28:55,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:28:55" (3/3) ... [2018-12-09 09:28:55,646 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_false-unreach-call.i [2018-12-09 09:28:55,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,669 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,669 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,669 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,669 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,670 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,671 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,672 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,674 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:28:55,681 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 09:28:55,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:28:55,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 09:28:55,696 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 09:28:55,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:28:55,712 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:28:55,712 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:28:55,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:28:55,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:28:55,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:28:55,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:28:55,712 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:28:55,719 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-09 09:28:56,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-12-09 09:28:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-12-09 09:28:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 09:28:56,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:28:56,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:28:56,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:28:56,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:28:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-12-09 09:28:56,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:28:56,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:56,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:28:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:56,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:28:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:28:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:28:56,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:28:56,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:28:56,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:28:56,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:28:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:28:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:28:56,848 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-12-09 09:28:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:28:57,203 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-12-09 09:28:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:28:57,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-09 09:28:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:28:57,366 INFO L225 Difference]: With dead ends: 45394 [2018-12-09 09:28:57,366 INFO L226 Difference]: Without dead ends: 40634 [2018-12-09 09:28:57,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:28:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-12-09 09:28:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-12-09 09:28:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-12-09 09:28:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-12-09 09:28:58,062 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-12-09 09:28:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:28:58,063 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-12-09 09:28:58,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:28:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-12-09 09:28:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 09:28:58,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:28:58,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] [2018-12-09 09:28:58,068 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:28:58,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:28:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-12-09 09:28:58,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:28:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:28:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:58,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:28:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:28:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:28:58,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:28:58,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:28:58,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:28:58,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:28:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:28:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:28:58,136 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-12-09 09:28:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:28:58,741 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-12-09 09:28:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:28:58,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 09:28:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:28:58,920 INFO L225 Difference]: With dead ends: 64836 [2018-12-09 09:28:58,921 INFO L226 Difference]: Without dead ends: 64676 [2018-12-09 09:28:58,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:28:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-12-09 09:28:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-12-09 09:28:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-12-09 09:28:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-12-09 09:28:59,688 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-12-09 09:28:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:28:59,689 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-12-09 09:28:59,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:28:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-12-09 09:28:59,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:28:59,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:28:59,691 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-09 09:28:59,691 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:28:59,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:28:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-12-09 09:28:59,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:28:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:59,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:28:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:59,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:28:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:28:59,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-09 09:28:59,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:28:59,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:28:59,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:28:59,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:28:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:28:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:28:59,725 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-12-09 09:28:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:28:59,783 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-12-09 09:28:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:28:59,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 09:28:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:28:59,798 INFO L225 Difference]: With dead ends: 12370 [2018-12-09 09:28:59,799 INFO L226 Difference]: Without dead ends: 11849 [2018-12-09 09:28:59,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:28:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-12-09 09:28:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-12-09 09:28:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-12-09 09:28:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-12-09 09:28:59,930 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-12-09 09:28:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:28:59,930 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-12-09 09:28:59,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:28:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-12-09 09:28:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:28:59,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:28:59,933 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-09 09:28:59,933 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:28:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:28:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-12-09 09:28:59,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:28:59,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:59,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:28:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:28:59,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:28:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:28:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:28:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:28:59,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:28:59,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:28:59,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:28:59,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:28:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:28:59,983 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-12-09 09:29:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:00,151 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-12-09 09:29:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:00,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 09:29:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:00,172 INFO L225 Difference]: With dead ends: 17025 [2018-12-09 09:29:00,172 INFO L226 Difference]: Without dead ends: 17025 [2018-12-09 09:29:00,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 09:29:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-12-09 09:29:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-12-09 09:29:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-12-09 09:29:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-12-09 09:29:00,380 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-12-09 09:29:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:00,380 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-12-09 09:29:00,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-12-09 09:29:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:00,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:00,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:00,385 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:00,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-12-09 09:29:00,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:00,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:00,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:00,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:00,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:00,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:00,446 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-12-09 09:29:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:00,906 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-12-09 09:29:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:00,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 09:29:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:00,928 INFO L225 Difference]: With dead ends: 18380 [2018-12-09 09:29:00,928 INFO L226 Difference]: Without dead ends: 18380 [2018-12-09 09:29:00,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-09 09:29:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-12-09 09:29:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-12-09 09:29:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-12-09 09:29:01,125 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-12-09 09:29:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:01,125 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-12-09 09:29:01,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-12-09 09:29:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:01,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:01,129 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-09 09:29:01,129 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:01,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:01,129 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-12-09 09:29:01,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:01,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:01,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:01,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:01,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:01,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:01,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:01,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:01,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:01,209 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-12-09 09:29:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:01,448 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-12-09 09:29:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:01,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 09:29:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:01,469 INFO L225 Difference]: With dead ends: 17857 [2018-12-09 09:29:01,469 INFO L226 Difference]: Without dead ends: 17857 [2018-12-09 09:29:01,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-12-09 09:29:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-12-09 09:29:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-12-09 09:29:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-12-09 09:29:01,657 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-12-09 09:29:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:01,657 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-12-09 09:29:01,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-12-09 09:29:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 09:29:01,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:01,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:01,661 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:01,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-12-09 09:29:01,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:01,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:01,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:01,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:01,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:01,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:01,722 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-12-09 09:29:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:02,032 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-12-09 09:29:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:29:02,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 09:29:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:02,129 INFO L225 Difference]: With dead ends: 23475 [2018-12-09 09:29:02,129 INFO L226 Difference]: Without dead ends: 23443 [2018-12-09 09:29:02,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:29:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-12-09 09:29:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-12-09 09:29:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-12-09 09:29:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-12-09 09:29:02,339 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-12-09 09:29:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-12-09 09:29:02,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-12-09 09:29:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 09:29:02,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:02,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:02,351 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:02,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-12-09 09:29:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:02,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:02,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:02,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:02,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:02,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:02,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:02,424 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-12-09 09:29:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:02,845 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-12-09 09:29:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:29:02,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-09 09:29:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:02,873 INFO L225 Difference]: With dead ends: 24535 [2018-12-09 09:29:02,873 INFO L226 Difference]: Without dead ends: 24471 [2018-12-09 09:29:02,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:29:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-12-09 09:29:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-12-09 09:29:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-12-09 09:29:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-12-09 09:29:03,121 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-12-09 09:29:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:03,122 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-12-09 09:29:03,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-12-09 09:29:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 09:29:03,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:03,137 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] [2018-12-09 09:29:03,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:03,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-12-09 09:29:03,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:03,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:03,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:29:03,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:03,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:29:03,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:29:03,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:03,159 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-12-09 09:29:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:03,239 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-12-09 09:29:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:29:03,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-09 09:29:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:03,268 INFO L225 Difference]: With dead ends: 24947 [2018-12-09 09:29:03,268 INFO L226 Difference]: Without dead ends: 24947 [2018-12-09 09:29:03,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-12-09 09:29:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-12-09 09:29:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-12-09 09:29:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-12-09 09:29:03,553 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-12-09 09:29:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:03,553 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-12-09 09:29:03,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:29:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-12-09 09:29:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 09:29:03,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:03,571 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] [2018-12-09 09:29:03,572 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:03,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-12-09 09:29:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:03,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:03,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:03,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:03,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:03,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:03,619 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-12-09 09:29:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:03,940 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-12-09 09:29:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:03,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 09:29:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:03,989 INFO L225 Difference]: With dead ends: 34667 [2018-12-09 09:29:03,990 INFO L226 Difference]: Without dead ends: 34471 [2018-12-09 09:29:03,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-12-09 09:29:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-12-09 09:29:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-12-09 09:29:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-12-09 09:29:04,402 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-12-09 09:29:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:04,402 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-12-09 09:29:04,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-12-09 09:29:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 09:29:04,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:04,423 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] [2018-12-09 09:29:04,423 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:04,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-12-09 09:29:04,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:04,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:04,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:04,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:04,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:04,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:04,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:04,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:04,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:04,487 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-12-09 09:29:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:04,938 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-12-09 09:29:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:29:04,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-12-09 09:29:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:05,008 INFO L225 Difference]: With dead ends: 52152 [2018-12-09 09:29:05,008 INFO L226 Difference]: Without dead ends: 51912 [2018-12-09 09:29:05,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:29:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-12-09 09:29:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-12-09 09:29:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-12-09 09:29:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-12-09 09:29:05,560 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-12-09 09:29:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:05,560 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-12-09 09:29:05,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-12-09 09:29:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 09:29:05,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:05,592 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] [2018-12-09 09:29:05,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:05,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-12-09 09:29:05,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:05,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:05,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:05,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:05,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:05,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:05,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:05,619 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-12-09 09:29:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:05,653 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-12-09 09:29:05,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:05,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-09 09:29:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:05,657 INFO L225 Difference]: With dead ends: 5456 [2018-12-09 09:29:05,657 INFO L226 Difference]: Without dead ends: 4832 [2018-12-09 09:29:05,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-12-09 09:29:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-12-09 09:29:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-12-09 09:29:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-12-09 09:29:05,692 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-12-09 09:29:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:05,692 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-12-09 09:29:05,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-12-09 09:29:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 09:29:05,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:05,696 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-09 09:29:05,696 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:05,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2018-12-09 09:29:05,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:05,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:05,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:05,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:05,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:05,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:05,737 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-12-09 09:29:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:05,889 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-12-09 09:29:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:05,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-09 09:29:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:05,893 INFO L225 Difference]: With dead ends: 5468 [2018-12-09 09:29:05,894 INFO L226 Difference]: Without dead ends: 5440 [2018-12-09 09:29:05,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-09 09:29:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-12-09 09:29:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-12-09 09:29:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-12-09 09:29:05,931 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-12-09 09:29:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:05,931 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-12-09 09:29:05,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-12-09 09:29:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 09:29:05,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:05,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:05,935 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:05,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2018-12-09 09:29:05,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:05,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:05,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:05,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:05,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:29:05,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:05,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:29:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:29:05,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:05,956 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-12-09 09:29:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:06,023 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-12-09 09:29:06,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:29:06,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-09 09:29:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:06,027 INFO L225 Difference]: With dead ends: 5440 [2018-12-09 09:29:06,027 INFO L226 Difference]: Without dead ends: 5440 [2018-12-09 09:29:06,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:29:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-09 09:29:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-12-09 09:29:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-12-09 09:29:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-12-09 09:29:06,063 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-12-09 09:29:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:06,064 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-12-09 09:29:06,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:29:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-12-09 09:29:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:06,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:06,068 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-09 09:29:06,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash -602105678, now seen corresponding path program 1 times [2018-12-09 09:29:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:06,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:06,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:06,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:06,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:06,114 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 5 states. [2018-12-09 09:29:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:06,291 INFO L93 Difference]: Finished difference Result 5683 states and 14775 transitions. [2018-12-09 09:29:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:06,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:29:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:06,296 INFO L225 Difference]: With dead ends: 5683 [2018-12-09 09:29:06,296 INFO L226 Difference]: Without dead ends: 5683 [2018-12-09 09:29:06,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2018-12-09 09:29:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5398. [2018-12-09 09:29:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2018-12-09 09:29:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 14084 transitions. [2018-12-09 09:29:06,337 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 14084 transitions. Word has length 91 [2018-12-09 09:29:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:06,337 INFO L480 AbstractCegarLoop]: Abstraction has 5398 states and 14084 transitions. [2018-12-09 09:29:06,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 14084 transitions. [2018-12-09 09:29:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:06,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:06,341 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-09 09:29:06,341 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:06,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash 531084915, now seen corresponding path program 1 times [2018-12-09 09:29:06,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:06,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:06,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:06,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:06,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:29:06,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:06,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:29:06,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:29:06,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:29:06,377 INFO L87 Difference]: Start difference. First operand 5398 states and 14084 transitions. Second operand 4 states. [2018-12-09 09:29:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:06,533 INFO L93 Difference]: Finished difference Result 11568 states and 30967 transitions. [2018-12-09 09:29:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:06,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 09:29:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:06,542 INFO L225 Difference]: With dead ends: 11568 [2018-12-09 09:29:06,542 INFO L226 Difference]: Without dead ends: 11519 [2018-12-09 09:29:06,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2018-12-09 09:29:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 5140. [2018-12-09 09:29:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-12-09 09:29:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13373 transitions. [2018-12-09 09:29:06,601 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13373 transitions. Word has length 91 [2018-12-09 09:29:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:06,601 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13373 transitions. [2018-12-09 09:29:06,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:29:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13373 transitions. [2018-12-09 09:29:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:06,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:06,604 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-09 09:29:06,605 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:06,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1618352203, now seen corresponding path program 1 times [2018-12-09 09:29:06,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:06,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:06,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:06,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:06,659 INFO L87 Difference]: Start difference. First operand 5140 states and 13373 transitions. Second operand 6 states. [2018-12-09 09:29:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:06,795 INFO L93 Difference]: Finished difference Result 6850 states and 17496 transitions. [2018-12-09 09:29:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:06,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:06,800 INFO L225 Difference]: With dead ends: 6850 [2018-12-09 09:29:06,800 INFO L226 Difference]: Without dead ends: 6818 [2018-12-09 09:29:06,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2018-12-09 09:29:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 5615. [2018-12-09 09:29:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2018-12-09 09:29:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 14463 transitions. [2018-12-09 09:29:06,845 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 14463 transitions. Word has length 91 [2018-12-09 09:29:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:06,845 INFO L480 AbstractCegarLoop]: Abstraction has 5615 states and 14463 transitions. [2018-12-09 09:29:06,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 14463 transitions. [2018-12-09 09:29:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:06,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:06,849 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-09 09:29:06,849 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:06,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1901502667, now seen corresponding path program 1 times [2018-12-09 09:29:06,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:06,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:06,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:06,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:06,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:06,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:06,902 INFO L87 Difference]: Start difference. First operand 5615 states and 14463 transitions. Second operand 7 states. [2018-12-09 09:29:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:07,197 INFO L93 Difference]: Finished difference Result 11651 states and 30335 transitions. [2018-12-09 09:29:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:29:07,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 09:29:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:07,206 INFO L225 Difference]: With dead ends: 11651 [2018-12-09 09:29:07,206 INFO L226 Difference]: Without dead ends: 11651 [2018-12-09 09:29:07,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:29:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2018-12-09 09:29:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 6113. [2018-12-09 09:29:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2018-12-09 09:29:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 15768 transitions. [2018-12-09 09:29:07,272 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 15768 transitions. Word has length 91 [2018-12-09 09:29:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:07,272 INFO L480 AbstractCegarLoop]: Abstraction has 6113 states and 15768 transitions. [2018-12-09 09:29:07,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 15768 transitions. [2018-12-09 09:29:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:07,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:07,277 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-09 09:29:07,277 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:07,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash -656738186, now seen corresponding path program 1 times [2018-12-09 09:29:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:07,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:07,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:07,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:07,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:07,334 INFO L87 Difference]: Start difference. First operand 6113 states and 15768 transitions. Second operand 5 states. [2018-12-09 09:29:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:07,365 INFO L93 Difference]: Finished difference Result 9700 states and 25509 transitions. [2018-12-09 09:29:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:29:07,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 09:29:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:07,373 INFO L225 Difference]: With dead ends: 9700 [2018-12-09 09:29:07,373 INFO L226 Difference]: Without dead ends: 9700 [2018-12-09 09:29:07,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2018-12-09 09:29:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 5539. [2018-12-09 09:29:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2018-12-09 09:29:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 14328 transitions. [2018-12-09 09:29:07,426 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 14328 transitions. Word has length 91 [2018-12-09 09:29:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:07,427 INFO L480 AbstractCegarLoop]: Abstraction has 5539 states and 14328 transitions. [2018-12-09 09:29:07,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 14328 transitions. [2018-12-09 09:29:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:07,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:07,430 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-09 09:29:07,431 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:07,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1702568823, now seen corresponding path program 1 times [2018-12-09 09:29:07,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:07,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:07,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:07,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:07,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:07,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:07,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:07,485 INFO L87 Difference]: Start difference. First operand 5539 states and 14328 transitions. Second operand 6 states. [2018-12-09 09:29:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:07,520 INFO L93 Difference]: Finished difference Result 8960 states and 23608 transitions. [2018-12-09 09:29:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:29:07,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:07,527 INFO L225 Difference]: With dead ends: 8960 [2018-12-09 09:29:07,527 INFO L226 Difference]: Without dead ends: 8960 [2018-12-09 09:29:07,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8960 states. [2018-12-09 09:29:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8960 to 5227. [2018-12-09 09:29:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2018-12-09 09:29:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 13455 transitions. [2018-12-09 09:29:07,575 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 13455 transitions. Word has length 91 [2018-12-09 09:29:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:07,575 INFO L480 AbstractCegarLoop]: Abstraction has 5227 states and 13455 transitions. [2018-12-09 09:29:07,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 13455 transitions. [2018-12-09 09:29:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:29:07,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:07,579 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-09 09:29:07,579 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:07,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2111682057, now seen corresponding path program 1 times [2018-12-09 09:29:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:07,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:29:07,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:07,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:29:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:29:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:29:07,645 INFO L87 Difference]: Start difference. First operand 5227 states and 13455 transitions. Second operand 6 states. [2018-12-09 09:29:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:07,741 INFO L93 Difference]: Finished difference Result 4523 states and 11391 transitions. [2018-12-09 09:29:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:07,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 09:29:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:07,745 INFO L225 Difference]: With dead ends: 4523 [2018-12-09 09:29:07,745 INFO L226 Difference]: Without dead ends: 4523 [2018-12-09 09:29:07,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2018-12-09 09:29:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 3659. [2018-12-09 09:29:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2018-12-09 09:29:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 9437 transitions. [2018-12-09 09:29:07,771 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 9437 transitions. Word has length 91 [2018-12-09 09:29:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:07,771 INFO L480 AbstractCegarLoop]: Abstraction has 3659 states and 9437 transitions. [2018-12-09 09:29:07,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:29:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 9437 transitions. [2018-12-09 09:29:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:07,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:07,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:07,774 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:07,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash -879974516, now seen corresponding path program 1 times [2018-12-09 09:29:07,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:07,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:07,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:07,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:07,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:07,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:29:07,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:07,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:29:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:29:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:29:07,833 INFO L87 Difference]: Start difference. First operand 3659 states and 9437 transitions. Second operand 8 states. [2018-12-09 09:29:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,082 INFO L93 Difference]: Finished difference Result 5920 states and 14721 transitions. [2018-12-09 09:29:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:29:08,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 09:29:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:08,086 INFO L225 Difference]: With dead ends: 5920 [2018-12-09 09:29:08,086 INFO L226 Difference]: Without dead ends: 5888 [2018-12-09 09:29:08,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 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-09 09:29:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2018-12-09 09:29:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 4271. [2018-12-09 09:29:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-12-09 09:29:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10898 transitions. [2018-12-09 09:29:08,120 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10898 transitions. Word has length 93 [2018-12-09 09:29:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:08,120 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10898 transitions. [2018-12-09 09:29:08,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:29:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10898 transitions. [2018-12-09 09:29:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:08,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:08,123 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-09 09:29:08,123 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:08,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 364789965, now seen corresponding path program 1 times [2018-12-09 09:29:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:08,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:08,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:08,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:08,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:08,201 INFO L87 Difference]: Start difference. First operand 4271 states and 10898 transitions. Second operand 7 states. [2018-12-09 09:29:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,268 INFO L93 Difference]: Finished difference Result 3981 states and 10019 transitions. [2018-12-09 09:29:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:29:08,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:08,271 INFO L225 Difference]: With dead ends: 3981 [2018-12-09 09:29:08,271 INFO L226 Difference]: Without dead ends: 3981 [2018-12-09 09:29:08,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:29:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-12-09 09:29:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3690. [2018-12-09 09:29:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3690 states. [2018-12-09 09:29:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 9463 transitions. [2018-12-09 09:29:08,304 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 9463 transitions. Word has length 93 [2018-12-09 09:29:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:08,304 INFO L480 AbstractCegarLoop]: Abstraction has 3690 states and 9463 transitions. [2018-12-09 09:29:08,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 9463 transitions. [2018-12-09 09:29:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:08,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:08,308 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-09 09:29:08,308 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:08,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash -550208755, now seen corresponding path program 1 times [2018-12-09 09:29:08,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:08,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:08,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:08,370 INFO L87 Difference]: Start difference. First operand 3690 states and 9463 transitions. Second operand 7 states. [2018-12-09 09:29:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,521 INFO L93 Difference]: Finished difference Result 4149 states and 10417 transitions. [2018-12-09 09:29:08,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:08,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:08,525 INFO L225 Difference]: With dead ends: 4149 [2018-12-09 09:29:08,525 INFO L226 Difference]: Without dead ends: 4149 [2018-12-09 09:29:08,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2018-12-09 09:29:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3764. [2018-12-09 09:29:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2018-12-09 09:29:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 9602 transitions. [2018-12-09 09:29:08,558 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 9602 transitions. Word has length 93 [2018-12-09 09:29:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:08,559 INFO L480 AbstractCegarLoop]: Abstraction has 3764 states and 9602 transitions. [2018-12-09 09:29:08,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 9602 transitions. [2018-12-09 09:29:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:08,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:08,561 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-09 09:29:08,562 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:08,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1650479819, now seen corresponding path program 2 times [2018-12-09 09:29:08,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:08,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:08,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:08,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:08,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:08,634 INFO L87 Difference]: Start difference. First operand 3764 states and 9602 transitions. Second operand 7 states. [2018-12-09 09:29:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,692 INFO L93 Difference]: Finished difference Result 3855 states and 9744 transitions. [2018-12-09 09:29:08,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:08,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:08,694 INFO L225 Difference]: With dead ends: 3855 [2018-12-09 09:29:08,695 INFO L226 Difference]: Without dead ends: 3835 [2018-12-09 09:29:08,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:29:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2018-12-09 09:29:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3710. [2018-12-09 09:29:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2018-12-09 09:29:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 9456 transitions. [2018-12-09 09:29:08,720 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 9456 transitions. Word has length 93 [2018-12-09 09:29:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:08,720 INFO L480 AbstractCegarLoop]: Abstraction has 3710 states and 9456 transitions. [2018-12-09 09:29:08,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 9456 transitions. [2018-12-09 09:29:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:08,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:08,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:29:08,723 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:08,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -285180468, now seen corresponding path program 1 times [2018-12-09 09:29:08,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:29:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:29:08,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:29:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:29:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:29:08,775 INFO L87 Difference]: Start difference. First operand 3710 states and 9456 transitions. Second operand 5 states. [2018-12-09 09:29:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:08,886 INFO L93 Difference]: Finished difference Result 4254 states and 10800 transitions. [2018-12-09 09:29:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:29:08,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 09:29:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:08,889 INFO L225 Difference]: With dead ends: 4254 [2018-12-09 09:29:08,889 INFO L226 Difference]: Without dead ends: 4222 [2018-12-09 09:29:08,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2018-12-09 09:29:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3758. [2018-12-09 09:29:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3758 states. [2018-12-09 09:29:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 9560 transitions. [2018-12-09 09:29:08,918 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 9560 transitions. Word has length 93 [2018-12-09 09:29:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:08,918 INFO L480 AbstractCegarLoop]: Abstraction has 3758 states and 9560 transitions. [2018-12-09 09:29:08,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:29:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 9560 transitions. [2018-12-09 09:29:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:08,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:08,920 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-09 09:29:08,921 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:08,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 959584013, now seen corresponding path program 1 times [2018-12-09 09:29:08,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:08,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:29:08,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:08,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:29:08,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:08,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:29:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:29:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:29:08,987 INFO L87 Difference]: Start difference. First operand 3758 states and 9560 transitions. Second operand 7 states. [2018-12-09 09:29:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:09,130 INFO L93 Difference]: Finished difference Result 5845 states and 14925 transitions. [2018-12-09 09:29:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:29:09,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 09:29:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,131 INFO L225 Difference]: With dead ends: 5845 [2018-12-09 09:29:09,132 INFO L226 Difference]: Without dead ends: 2182 [2018-12-09 09:29:09,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:29:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-09 09:29:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2018-12-09 09:29:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-12-09 09:29:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5546 transitions. [2018-12-09 09:29:09,145 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5546 transitions. Word has length 93 [2018-12-09 09:29:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,145 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 5546 transitions. [2018-12-09 09:29:09,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:29:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5546 transitions. [2018-12-09 09:29:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:09,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,147 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-09 09:29:09,147 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2018-12-09 09:29:09,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:29:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:29:09,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-09 09:29:09,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:29:09,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:29:09,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:29:09,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:29:09,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:29:09,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:29:09,247 INFO L87 Difference]: Start difference. First operand 2182 states and 5546 transitions. Second operand 12 states. [2018-12-09 09:29:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:29:09,616 INFO L93 Difference]: Finished difference Result 4039 states and 10414 transitions. [2018-12-09 09:29:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:29:09,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-09 09:29:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:29:09,618 INFO L225 Difference]: With dead ends: 4039 [2018-12-09 09:29:09,618 INFO L226 Difference]: Without dead ends: 2903 [2018-12-09 09:29:09,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 09:29:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-12-09 09:29:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2733. [2018-12-09 09:29:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2018-12-09 09:29:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 6802 transitions. [2018-12-09 09:29:09,636 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 6802 transitions. Word has length 93 [2018-12-09 09:29:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:29:09,636 INFO L480 AbstractCegarLoop]: Abstraction has 2733 states and 6802 transitions. [2018-12-09 09:29:09,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:29:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 6802 transitions. [2018-12-09 09:29:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 09:29:09,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:29:09,638 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-09 09:29:09,638 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:29:09,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:29:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-12-09 09:29:09,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:29:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:29:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:29:09,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:29:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:29:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:29:09,686 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:29:09,764 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 09:29:09,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:29:09 BasicIcfg [2018-12-09 09:29:09,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:29:09,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:29:09,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:29:09,766 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:29:09,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:28:55" (3/4) ... [2018-12-09 09:29:09,768 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:29:09,848 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b45219a-9414-44f6-8381-b81d0313638a/bin-2019/utaipan/witness.graphml [2018-12-09 09:29:09,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:29:09,849 INFO L168 Benchmark]: Toolchain (without parser) took 14911.07 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 953.5 MB in the beginning and 1.9 GB in the end (delta: -930.3 MB). Peak memory consumption was 660.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:09,850 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:29:09,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:09,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:09,851 INFO L168 Benchmark]: Boogie Preprocessor took 20.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:29:09,851 INFO L168 Benchmark]: RCFGBuilder took 332.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:09,852 INFO L168 Benchmark]: TraceAbstraction took 14123.71 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -833.7 MB). Peak memory consumption was 599.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:09,852 INFO L168 Benchmark]: Witness Printer took 82.56 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:29:09,853 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 332.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14123.71 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -833.7 MB). Peak memory consumption was 599.7 MB. Max. memory is 11.5 GB. * Witness Printer took 82.56 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 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] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2476; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2476, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [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=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 14.0s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6910 SDtfs, 6519 SDslu, 15219 SDs, 0 SdLazy, 6039 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 83 SyntacticMatches, 18 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, 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: 4.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 101430 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2269 NumberOfCodeBlocks, 2269 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2148 ConstructedInterpolants, 0 QuantifiedInterpolants, 442326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...