./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/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 52f250ce523e42d8ac81c9c1780b17f1f4712371 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:21:39,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:21:39,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:21:39,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:21:39,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:21:39,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:21:39,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:21:39,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:21:39,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:21:39,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:21:39,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:21:39,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:21:39,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:21:39,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:21:39,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:21:39,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:21:39,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:21:39,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:21:39,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:21:39,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:21:39,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:21:39,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:21:39,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:21:39,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:21:39,328 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:21:39,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:21:39,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:21:39,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:21:39,330 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:21:39,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:21:39,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:21:39,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:21:39,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:21:39,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:21:39,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:21:39,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:21:39,332 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:21:39,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:21:39,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:21:39,340 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:21:39,340 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:21:39,340 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:21:39,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:21:39,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:21:39,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:21:39,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:21:39,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:21:39,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:21:39,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:21:39,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:21:39,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:21:39,343 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:21:39,343 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_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/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 -> 52f250ce523e42d8ac81c9c1780b17f1f4712371 [2018-12-03 07:21:39,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:21:39,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:21:39,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:21:39,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:21:39,374 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:21:39,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2018-12-03 07:21:39,421 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/data/0eaf9e3a5/27941356d9504785b7bcbbbd6424f3f9/FLAGf9d6e9e2f [2018-12-03 07:21:39,780 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:21:39,780 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2018-12-03 07:21:39,787 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/data/0eaf9e3a5/27941356d9504785b7bcbbbd6424f3f9/FLAGf9d6e9e2f [2018-12-03 07:21:39,796 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/data/0eaf9e3a5/27941356d9504785b7bcbbbd6424f3f9 [2018-12-03 07:21:39,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:21:39,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:21:39,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:21:39,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:21:39,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:21:39,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:21:39" (1/1) ... [2018-12-03 07:21:39,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4599fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:39, skipping insertion in model container [2018-12-03 07:21:39,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:21:39" (1/1) ... [2018-12-03 07:21:39,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:21:39,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:21:40,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:21:40,016 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:21:40,088 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:21:40,122 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:21:40,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40 WrapperNode [2018-12-03 07:21:40,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:21:40,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:21:40,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:21:40,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:21:40,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:21:40,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:21:40,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:21:40,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:21:40,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... [2018-12-03 07:21:40,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:21:40,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:21:40,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:21:40,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:21:40,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 07:21:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 07:21:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 07:21:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 07:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:21:40,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:21:40,209 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 07:21:40,513 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:21:40,513 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 07:21:40,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:40 BoogieIcfgContainer [2018-12-03 07:21:40,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:21:40,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:21:40,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:21:40,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:21:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:21:39" (1/3) ... [2018-12-03 07:21:40,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a34b65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:40, skipping insertion in model container [2018-12-03 07:21:40,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:21:40" (2/3) ... [2018-12-03 07:21:40,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a34b65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:21:40, skipping insertion in model container [2018-12-03 07:21:40,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:40" (3/3) ... [2018-12-03 07:21:40,518 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt_false-unreach-call.i [2018-12-03 07:21:40,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,540 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,540 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,541 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,542 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,543 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,544 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,544 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,544 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,544 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,544 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,544 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,545 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,546 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,550 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:21:40,560 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 07:21:40,561 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:21:40,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 07:21:40,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 07:21:40,590 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:21:40,590 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:21:40,590 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:21:40,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:21:40,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:21:40,590 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:21:40,590 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:21:40,590 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:21:40,597 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-03 07:21:56,801 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-03 07:21:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-03 07:21:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 07:21:56,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:21:56,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:21:56,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:21:56,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:21:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash 961127934, now seen corresponding path program 1 times [2018-12-03 07:21:56,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:21:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:21:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:21:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:21:56,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:21:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:21:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:21:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:21:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:21:56,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:21:56,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:21:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:21:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:21:56,991 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-03 07:21:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:21:58,444 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-03 07:21:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:21:58,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-03 07:21:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:21:59,210 INFO L225 Difference]: With dead ends: 233472 [2018-12-03 07:21:59,211 INFO L226 Difference]: Without dead ends: 203722 [2018-12-03 07:21:59,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:22:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-03 07:22:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-03 07:22:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-03 07:22:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-03 07:22:04,498 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-03 07:22:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:04,499 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-03 07:22:04,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:22:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-03 07:22:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 07:22:04,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:04,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:04,507 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:04,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash -94457539, now seen corresponding path program 1 times [2018-12-03 07:22:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:04,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:04,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:04,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:22:04,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:04,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:22:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:22:04,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:22:04,553 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-03 07:22:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:05,107 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-03 07:22:05,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:22:05,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 07:22:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:05,977 INFO L225 Difference]: With dead ends: 118892 [2018-12-03 07:22:05,977 INFO L226 Difference]: Without dead ends: 118892 [2018-12-03 07:22:05,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:22:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-03 07:22:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-03 07:22:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-03 07:22:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-03 07:22:08,658 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-03 07:22:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:08,659 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-03 07:22:08,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:22:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-03 07:22:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 07:22:08,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:08,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:08,663 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:08,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1901912002, now seen corresponding path program 1 times [2018-12-03 07:22:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:08,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:08,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:08,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:08,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:22:08,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:08,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:22:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:22:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:08,725 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-03 07:22:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:12,636 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-03 07:22:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:22:12,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-03 07:22:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:13,496 INFO L225 Difference]: With dead ends: 325272 [2018-12-03 07:22:13,497 INFO L226 Difference]: Without dead ends: 324272 [2018-12-03 07:22:13,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:22:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-03 07:22:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-03 07:22:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-03 07:22:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-03 07:22:18,817 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-03 07:22:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:18,818 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-03 07:22:18,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:22:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-03 07:22:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 07:22:18,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:18,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:18,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:18,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash 945118259, now seen corresponding path program 1 times [2018-12-03 07:22:18,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:18,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:18,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:22:18,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:18,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:22:18,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:22:18,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:22:18,855 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 3 states. [2018-12-03 07:22:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:19,703 INFO L93 Difference]: Finished difference Result 186422 states and 840549 transitions. [2018-12-03 07:22:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:22:19,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 07:22:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:20,177 INFO L225 Difference]: With dead ends: 186422 [2018-12-03 07:22:20,177 INFO L226 Difference]: Without dead ends: 186422 [2018-12-03 07:22:20,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:22:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186422 states. [2018-12-03 07:22:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186422 to 186422. [2018-12-03 07:22:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-03 07:22:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840549 transitions. [2018-12-03 07:22:27,374 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840549 transitions. Word has length 51 [2018-12-03 07:22:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:27,374 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840549 transitions. [2018-12-03 07:22:27,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:22:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840549 transitions. [2018-12-03 07:22:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 07:22:27,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:27,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:27,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:27,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1607038702, now seen corresponding path program 1 times [2018-12-03 07:22:27,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:27,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:27,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:27,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:27,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:27,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:22:27,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:27,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:22:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:22:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:22:27,427 INFO L87 Difference]: Start difference. First operand 186422 states and 840549 transitions. Second operand 4 states. [2018-12-03 07:22:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:28,137 INFO L93 Difference]: Finished difference Result 163598 states and 725160 transitions. [2018-12-03 07:22:28,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:22:28,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 07:22:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:28,539 INFO L225 Difference]: With dead ends: 163598 [2018-12-03 07:22:28,539 INFO L226 Difference]: Without dead ends: 160993 [2018-12-03 07:22:28,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-03 07:22:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-03 07:22:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-03 07:22:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716488 transitions. [2018-12-03 07:22:32,244 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716488 transitions. Word has length 51 [2018-12-03 07:22:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:32,244 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716488 transitions. [2018-12-03 07:22:32,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:22:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716488 transitions. [2018-12-03 07:22:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:22:32,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:32,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:32,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:32,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 18302830, now seen corresponding path program 1 times [2018-12-03 07:22:32,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:32,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:32,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:32,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:32,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:22:32,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:32,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:22:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:22:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:32,297 INFO L87 Difference]: Start difference. First operand 160993 states and 716488 transitions. Second operand 5 states. [2018-12-03 07:22:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:33,769 INFO L93 Difference]: Finished difference Result 289849 states and 1285293 transitions. [2018-12-03 07:22:33,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:22:33,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 07:22:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:34,563 INFO L225 Difference]: With dead ends: 289849 [2018-12-03 07:22:34,564 INFO L226 Difference]: Without dead ends: 289009 [2018-12-03 07:22:34,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:22:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289009 states. [2018-12-03 07:22:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289009 to 169613. [2018-12-03 07:22:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169613 states. [2018-12-03 07:22:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169613 states to 169613 states and 752341 transitions. [2018-12-03 07:22:41,238 INFO L78 Accepts]: Start accepts. Automaton has 169613 states and 752341 transitions. Word has length 52 [2018-12-03 07:22:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:41,238 INFO L480 AbstractCegarLoop]: Abstraction has 169613 states and 752341 transitions. [2018-12-03 07:22:41,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:22:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 169613 states and 752341 transitions. [2018-12-03 07:22:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:22:41,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:41,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:41,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:41,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1846844042, now seen corresponding path program 1 times [2018-12-03 07:22:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:41,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:41,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:41,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:22:41,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:41,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:22:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:22:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:41,312 INFO L87 Difference]: Start difference. First operand 169613 states and 752341 transitions. Second operand 5 states. [2018-12-03 07:22:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:41,558 INFO L93 Difference]: Finished difference Result 59117 states and 239313 transitions. [2018-12-03 07:22:41,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:22:41,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-03 07:22:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:41,673 INFO L225 Difference]: With dead ends: 59117 [2018-12-03 07:22:41,674 INFO L226 Difference]: Without dead ends: 56805 [2018-12-03 07:22:41,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56805 states. [2018-12-03 07:22:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56805 to 56805. [2018-12-03 07:22:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56805 states. [2018-12-03 07:22:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56805 states to 56805 states and 230659 transitions. [2018-12-03 07:22:42,872 INFO L78 Accepts]: Start accepts. Automaton has 56805 states and 230659 transitions. Word has length 59 [2018-12-03 07:22:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 56805 states and 230659 transitions. [2018-12-03 07:22:42,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:22:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 56805 states and 230659 transitions. [2018-12-03 07:22:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 07:22:42,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:42,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:42,883 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1949259451, now seen corresponding path program 1 times [2018-12-03 07:22:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:42,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:42,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:42,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:42,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:42,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:22:42,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:42,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:22:42,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:22:42,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:22:42,933 INFO L87 Difference]: Start difference. First operand 56805 states and 230659 transitions. Second operand 4 states. [2018-12-03 07:22:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:43,589 INFO L93 Difference]: Finished difference Result 80270 states and 321738 transitions. [2018-12-03 07:22:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:22:43,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-03 07:22:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:43,748 INFO L225 Difference]: With dead ends: 80270 [2018-12-03 07:22:43,748 INFO L226 Difference]: Without dead ends: 80270 [2018-12-03 07:22:43,748 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-03 07:22:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80270 states. [2018-12-03 07:22:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80270 to 72201. [2018-12-03 07:22:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72201 states. [2018-12-03 07:22:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72201 states to 72201 states and 291246 transitions. [2018-12-03 07:22:45,368 INFO L78 Accepts]: Start accepts. Automaton has 72201 states and 291246 transitions. Word has length 65 [2018-12-03 07:22:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:45,368 INFO L480 AbstractCegarLoop]: Abstraction has 72201 states and 291246 transitions. [2018-12-03 07:22:45,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:22:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 72201 states and 291246 transitions. [2018-12-03 07:22:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 07:22:45,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:45,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:45,380 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:45,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 952187098, now seen corresponding path program 1 times [2018-12-03 07:22:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:45,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:45,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:45,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:45,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:45,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:45,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:45,418 INFO L87 Difference]: Start difference. First operand 72201 states and 291246 transitions. Second operand 6 states. [2018-12-03 07:22:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:45,494 INFO L93 Difference]: Finished difference Result 10873 states and 37510 transitions. [2018-12-03 07:22:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:22:45,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 07:22:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:45,511 INFO L225 Difference]: With dead ends: 10873 [2018-12-03 07:22:45,512 INFO L226 Difference]: Without dead ends: 9621 [2018-12-03 07:22:45,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:22:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9621 states. [2018-12-03 07:22:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9621 to 9586. [2018-12-03 07:22:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9586 states. [2018-12-03 07:22:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9586 states to 9586 states and 32946 transitions. [2018-12-03 07:22:45,622 INFO L78 Accepts]: Start accepts. Automaton has 9586 states and 32946 transitions. Word has length 65 [2018-12-03 07:22:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:45,622 INFO L480 AbstractCegarLoop]: Abstraction has 9586 states and 32946 transitions. [2018-12-03 07:22:45,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9586 states and 32946 transitions. [2018-12-03 07:22:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 07:22:45,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:45,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:45,635 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:45,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1715385842, now seen corresponding path program 1 times [2018-12-03 07:22:45,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:45,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:45,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:45,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:45,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:45,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:45,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:22:45,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:45,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:22:45,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:22:45,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:22:45,683 INFO L87 Difference]: Start difference. First operand 9586 states and 32946 transitions. Second operand 3 states. [2018-12-03 07:22:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:45,775 INFO L93 Difference]: Finished difference Result 10146 states and 34654 transitions. [2018-12-03 07:22:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:22:45,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-03 07:22:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:45,786 INFO L225 Difference]: With dead ends: 10146 [2018-12-03 07:22:45,786 INFO L226 Difference]: Without dead ends: 10146 [2018-12-03 07:22:45,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:22:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10146 states. [2018-12-03 07:22:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10146 to 9866. [2018-12-03 07:22:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9866 states. [2018-12-03 07:22:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 33800 transitions. [2018-12-03 07:22:45,890 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 33800 transitions. Word has length 98 [2018-12-03 07:22:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:45,891 INFO L480 AbstractCegarLoop]: Abstraction has 9866 states and 33800 transitions. [2018-12-03 07:22:45,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:22:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 33800 transitions. [2018-12-03 07:22:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 07:22:45,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:45,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:45,903 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:45,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:45,903 INFO L82 PathProgramCache]: Analyzing trace with hash 457084711, now seen corresponding path program 1 times [2018-12-03 07:22:45,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:45,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:45,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:45,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:45,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:45,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:22:45,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:45,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:22:45,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:22:45,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:45,973 INFO L87 Difference]: Start difference. First operand 9866 states and 33800 transitions. Second operand 5 states. [2018-12-03 07:22:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:46,110 INFO L93 Difference]: Finished difference Result 11874 states and 40032 transitions. [2018-12-03 07:22:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:22:46,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-03 07:22:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:46,124 INFO L225 Difference]: With dead ends: 11874 [2018-12-03 07:22:46,124 INFO L226 Difference]: Without dead ends: 11774 [2018-12-03 07:22:46,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:22:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11774 states. [2018-12-03 07:22:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11774 to 10541. [2018-12-03 07:22:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10541 states. [2018-12-03 07:22:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 35845 transitions. [2018-12-03 07:22:46,239 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 35845 transitions. Word has length 98 [2018-12-03 07:22:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:46,240 INFO L480 AbstractCegarLoop]: Abstraction has 10541 states and 35845 transitions. [2018-12-03 07:22:46,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:22:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 35845 transitions. [2018-12-03 07:22:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:46,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:46,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:46,253 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:46,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -49676000, now seen corresponding path program 1 times [2018-12-03 07:22:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:46,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:46,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:22:46,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:22:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:22:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:22:46,285 INFO L87 Difference]: Start difference. First operand 10541 states and 35845 transitions. Second operand 4 states. [2018-12-03 07:22:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:46,395 INFO L93 Difference]: Finished difference Result 18037 states and 61515 transitions. [2018-12-03 07:22:46,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:22:46,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 07:22:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:46,417 INFO L225 Difference]: With dead ends: 18037 [2018-12-03 07:22:46,417 INFO L226 Difference]: Without dead ends: 17937 [2018-12-03 07:22:46,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:22:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17937 states. [2018-12-03 07:22:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17937 to 9996. [2018-12-03 07:22:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2018-12-03 07:22:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 33674 transitions. [2018-12-03 07:22:46,564 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 33674 transitions. Word has length 100 [2018-12-03 07:22:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:46,564 INFO L480 AbstractCegarLoop]: Abstraction has 9996 states and 33674 transitions. [2018-12-03 07:22:46,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:22:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 33674 transitions. [2018-12-03 07:22:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:46,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:46,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:46,575 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:46,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1233023297, now seen corresponding path program 1 times [2018-12-03 07:22:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:46,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:46,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:46,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:46,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:46,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:46,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:46,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:46,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:46,638 INFO L87 Difference]: Start difference. First operand 9996 states and 33674 transitions. Second operand 6 states. [2018-12-03 07:22:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:46,799 INFO L93 Difference]: Finished difference Result 12576 states and 41663 transitions. [2018-12-03 07:22:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:22:46,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 07:22:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:46,815 INFO L225 Difference]: With dead ends: 12576 [2018-12-03 07:22:46,816 INFO L226 Difference]: Without dead ends: 12576 [2018-12-03 07:22:46,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2018-12-03 07:22:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 10376. [2018-12-03 07:22:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-03 07:22:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 34908 transitions. [2018-12-03 07:22:46,947 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 34908 transitions. Word has length 100 [2018-12-03 07:22:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:46,947 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 34908 transitions. [2018-12-03 07:22:46,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 34908 transitions. [2018-12-03 07:22:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:46,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:46,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:46,961 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:46,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash -263442274, now seen corresponding path program 1 times [2018-12-03 07:22:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:46,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:46,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:47,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:47,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:47,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:47,056 INFO L87 Difference]: Start difference. First operand 10376 states and 34908 transitions. Second operand 6 states. [2018-12-03 07:22:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:47,253 INFO L93 Difference]: Finished difference Result 9240 states and 30906 transitions. [2018-12-03 07:22:47,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:22:47,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 07:22:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:47,264 INFO L225 Difference]: With dead ends: 9240 [2018-12-03 07:22:47,264 INFO L226 Difference]: Without dead ends: 9240 [2018-12-03 07:22:47,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:22:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2018-12-03 07:22:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 8996. [2018-12-03 07:22:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8996 states. [2018-12-03 07:22:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8996 states to 8996 states and 30179 transitions. [2018-12-03 07:22:47,351 INFO L78 Accepts]: Start accepts. Automaton has 8996 states and 30179 transitions. Word has length 100 [2018-12-03 07:22:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:47,352 INFO L480 AbstractCegarLoop]: Abstraction has 8996 states and 30179 transitions. [2018-12-03 07:22:47,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8996 states and 30179 transitions. [2018-12-03 07:22:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:47,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:47,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:47,360 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:47,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -668241567, now seen corresponding path program 1 times [2018-12-03 07:22:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:47,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:47,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:47,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:47,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:47,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:47,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:47,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:47,410 INFO L87 Difference]: Start difference. First operand 8996 states and 30179 transitions. Second operand 6 states. [2018-12-03 07:22:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:47,661 INFO L93 Difference]: Finished difference Result 10306 states and 33807 transitions. [2018-12-03 07:22:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:22:47,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 07:22:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:47,671 INFO L225 Difference]: With dead ends: 10306 [2018-12-03 07:22:47,672 INFO L226 Difference]: Without dead ends: 10001 [2018-12-03 07:22:47,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10001 states. [2018-12-03 07:22:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10001 to 9511. [2018-12-03 07:22:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9511 states. [2018-12-03 07:22:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9511 states to 9511 states and 31526 transitions. [2018-12-03 07:22:47,769 INFO L78 Accepts]: Start accepts. Automaton has 9511 states and 31526 transitions. Word has length 100 [2018-12-03 07:22:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:47,769 INFO L480 AbstractCegarLoop]: Abstraction has 9511 states and 31526 transitions. [2018-12-03 07:22:47,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 9511 states and 31526 transitions. [2018-12-03 07:22:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:47,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:47,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:47,779 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:47,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1032498912, now seen corresponding path program 1 times [2018-12-03 07:22:47,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:47,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:47,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:47,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:47,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:47,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:47,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:22:47,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:47,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:22:47,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:22:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:47,869 INFO L87 Difference]: Start difference. First operand 9511 states and 31526 transitions. Second operand 7 states. [2018-12-03 07:22:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:48,042 INFO L93 Difference]: Finished difference Result 10399 states and 34432 transitions. [2018-12-03 07:22:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:22:48,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-03 07:22:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:48,054 INFO L225 Difference]: With dead ends: 10399 [2018-12-03 07:22:48,054 INFO L226 Difference]: Without dead ends: 10399 [2018-12-03 07:22:48,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10399 states. [2018-12-03 07:22:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10399 to 9406. [2018-12-03 07:22:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9406 states. [2018-12-03 07:22:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9406 states to 9406 states and 31242 transitions. [2018-12-03 07:22:48,156 INFO L78 Accepts]: Start accepts. Automaton has 9406 states and 31242 transitions. Word has length 100 [2018-12-03 07:22:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:48,156 INFO L480 AbstractCegarLoop]: Abstraction has 9406 states and 31242 transitions. [2018-12-03 07:22:48,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:22:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9406 states and 31242 transitions. [2018-12-03 07:22:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:48,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:48,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:48,166 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:48,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1851588864, now seen corresponding path program 1 times [2018-12-03 07:22:48,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:48,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:48,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:48,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:22:48,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:48,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:22:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:22:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:48,247 INFO L87 Difference]: Start difference. First operand 9406 states and 31242 transitions. Second operand 5 states. [2018-12-03 07:22:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:48,328 INFO L93 Difference]: Finished difference Result 9236 states and 30536 transitions. [2018-12-03 07:22:48,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:22:48,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-03 07:22:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:48,338 INFO L225 Difference]: With dead ends: 9236 [2018-12-03 07:22:48,338 INFO L226 Difference]: Without dead ends: 9236 [2018-12-03 07:22:48,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9236 states. [2018-12-03 07:22:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9236 to 8656. [2018-12-03 07:22:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2018-12-03 07:22:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 28907 transitions. [2018-12-03 07:22:48,426 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 28907 transitions. Word has length 100 [2018-12-03 07:22:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:48,426 INFO L480 AbstractCegarLoop]: Abstraction has 8656 states and 28907 transitions. [2018-12-03 07:22:48,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:22:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 28907 transitions. [2018-12-03 07:22:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 07:22:48,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:48,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:48,434 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:48,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1994681793, now seen corresponding path program 1 times [2018-12-03 07:22:48,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:48,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:48,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:48,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:48,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:48,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:48,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:48,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:48,509 INFO L87 Difference]: Start difference. First operand 8656 states and 28907 transitions. Second operand 6 states. [2018-12-03 07:22:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:48,601 INFO L93 Difference]: Finished difference Result 7504 states and 24459 transitions. [2018-12-03 07:22:48,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:22:48,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 07:22:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:48,610 INFO L225 Difference]: With dead ends: 7504 [2018-12-03 07:22:48,610 INFO L226 Difference]: Without dead ends: 7504 [2018-12-03 07:22:48,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2018-12-03 07:22:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 6671. [2018-12-03 07:22:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-03 07:22:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-03 07:22:48,681 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-03 07:22:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:48,681 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-03 07:22:48,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-03 07:22:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:48,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:48,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:48,688 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:48,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -986687851, now seen corresponding path program 1 times [2018-12-03 07:22:48,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:48,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:48,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:48,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:48,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:22:48,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:48,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:22:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:22:48,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:48,740 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-03 07:22:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:49,034 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-03 07:22:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:22:49,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 07:22:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:49,047 INFO L225 Difference]: With dead ends: 12218 [2018-12-03 07:22:49,047 INFO L226 Difference]: Without dead ends: 12218 [2018-12-03 07:22:49,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:22:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-03 07:22:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-03 07:22:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-03 07:22:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-03 07:22:49,157 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-03 07:22:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:49,157 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-03 07:22:49,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:22:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-03 07:22:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:49,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:49,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:49,167 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:49,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 258076630, now seen corresponding path program 1 times [2018-12-03 07:22:49,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:49,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:49,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:49,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:49,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:49,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:49,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:49,235 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-03 07:22:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:49,321 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-03 07:22:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:22:49,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 07:22:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:49,332 INFO L225 Difference]: With dead ends: 9843 [2018-12-03 07:22:49,332 INFO L226 Difference]: Without dead ends: 9843 [2018-12-03 07:22:49,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:22:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-03 07:22:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-03 07:22:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-03 07:22:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-03 07:22:49,438 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-03 07:22:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:49,438 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-03 07:22:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-03 07:22:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:49,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:49,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:49,448 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:49,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash -656922090, now seen corresponding path program 1 times [2018-12-03 07:22:49,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:49,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:49,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:49,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:49,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:22:49,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:49,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:22:49,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:22:49,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:22:49,531 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-03 07:22:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:49,655 INFO L93 Difference]: Finished difference Result 17910 states and 59425 transitions. [2018-12-03 07:22:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:22:49,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 07:22:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:49,676 INFO L225 Difference]: With dead ends: 17910 [2018-12-03 07:22:49,676 INFO L226 Difference]: Without dead ends: 17910 [2018-12-03 07:22:49,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:22:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-12-03 07:22:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 9898. [2018-12-03 07:22:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9898 states. [2018-12-03 07:22:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9898 states to 9898 states and 32205 transitions. [2018-12-03 07:22:49,811 INFO L78 Accepts]: Start accepts. Automaton has 9898 states and 32205 transitions. Word has length 102 [2018-12-03 07:22:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:49,811 INFO L480 AbstractCegarLoop]: Abstraction has 9898 states and 32205 transitions. [2018-12-03 07:22:49,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:22:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 9898 states and 32205 transitions. [2018-12-03 07:22:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:49,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:49,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:49,821 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:49,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 476268503, now seen corresponding path program 1 times [2018-12-03 07:22:49,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:49,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:49,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:49,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:49,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:22:49,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:49,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:22:49,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:22:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:22:49,866 INFO L87 Difference]: Start difference. First operand 9898 states and 32205 transitions. Second operand 5 states. [2018-12-03 07:22:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:49,984 INFO L93 Difference]: Finished difference Result 11178 states and 36365 transitions. [2018-12-03 07:22:49,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:22:49,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 07:22:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:49,996 INFO L225 Difference]: With dead ends: 11178 [2018-12-03 07:22:49,996 INFO L226 Difference]: Without dead ends: 11178 [2018-12-03 07:22:49,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11178 states. [2018-12-03 07:22:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11178 to 8740. [2018-12-03 07:22:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8740 states. [2018-12-03 07:22:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8740 states to 8740 states and 28544 transitions. [2018-12-03 07:22:50,097 INFO L78 Accepts]: Start accepts. Automaton has 8740 states and 28544 transitions. Word has length 102 [2018-12-03 07:22:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:50,097 INFO L480 AbstractCegarLoop]: Abstraction has 8740 states and 28544 transitions. [2018-12-03 07:22:50,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:22:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8740 states and 28544 transitions. [2018-12-03 07:22:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:50,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:50,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:50,106 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:50,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1721032984, now seen corresponding path program 1 times [2018-12-03 07:22:50,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:50,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:50,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:50,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:22:50,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:50,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:22:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:22:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:50,179 INFO L87 Difference]: Start difference. First operand 8740 states and 28544 transitions. Second operand 7 states. [2018-12-03 07:22:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:50,365 INFO L93 Difference]: Finished difference Result 16054 states and 53047 transitions. [2018-12-03 07:22:50,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:22:50,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 07:22:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:50,374 INFO L225 Difference]: With dead ends: 16054 [2018-12-03 07:22:50,374 INFO L226 Difference]: Without dead ends: 8078 [2018-12-03 07:22:50,375 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-03 07:22:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8078 states. [2018-12-03 07:22:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8078 to 8048. [2018-12-03 07:22:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8048 states. [2018-12-03 07:22:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 26504 transitions. [2018-12-03 07:22:50,454 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 26504 transitions. Word has length 102 [2018-12-03 07:22:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:50,455 INFO L480 AbstractCegarLoop]: Abstraction has 8048 states and 26504 transitions. [2018-12-03 07:22:50,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:22:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 26504 transitions. [2018-12-03 07:22:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:50,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:50,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:50,463 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:50,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash 84668374, now seen corresponding path program 2 times [2018-12-03 07:22:50,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:50,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:50,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:50,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:50,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 07:22:50,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:50,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:22:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:22:50,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:22:50,590 INFO L87 Difference]: Start difference. First operand 8048 states and 26504 transitions. Second operand 10 states. [2018-12-03 07:22:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:50,894 INFO L93 Difference]: Finished difference Result 14790 states and 49443 transitions. [2018-12-03 07:22:50,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:22:50,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-03 07:22:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:50,903 INFO L225 Difference]: With dead ends: 14790 [2018-12-03 07:22:50,903 INFO L226 Difference]: Without dead ends: 6821 [2018-12-03 07:22:50,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:22:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-03 07:22:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-03 07:22:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-03 07:22:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-03 07:22:50,974 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-03 07:22:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:50,974 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-03 07:22:50,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:22:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-03 07:22:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:50,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:50,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:50,981 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:50,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1082345370, now seen corresponding path program 1 times [2018-12-03 07:22:50,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:50,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:22:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:50,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:51,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:22:51,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:51,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:22:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:22:51,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:51,047 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-03 07:22:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:51,242 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-03 07:22:51,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:22:51,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 07:22:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:51,252 INFO L225 Difference]: With dead ends: 8957 [2018-12-03 07:22:51,253 INFO L226 Difference]: Without dead ends: 8821 [2018-12-03 07:22:51,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:22:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-03 07:22:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-03 07:22:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-03 07:22:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-03 07:22:51,330 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-03 07:22:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:51,330 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-03 07:22:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:22:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-03 07:22:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:51,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:51,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:51,337 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:51,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:51,338 INFO L82 PathProgramCache]: Analyzing trace with hash -853314917, now seen corresponding path program 1 times [2018-12-03 07:22:51,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:51,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:51,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:51,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:51,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:22:51,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:51,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:22:51,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:22:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:22:51,408 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 7 states. [2018-12-03 07:22:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:51,568 INFO L93 Difference]: Finished difference Result 13593 states and 46438 transitions. [2018-12-03 07:22:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:22:51,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 07:22:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:51,586 INFO L225 Difference]: With dead ends: 13593 [2018-12-03 07:22:51,586 INFO L226 Difference]: Without dead ends: 13593 [2018-12-03 07:22:51,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:22:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2018-12-03 07:22:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 6965. [2018-12-03 07:22:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6965 states. [2018-12-03 07:22:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 23455 transitions. [2018-12-03 07:22:51,690 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 23455 transitions. Word has length 102 [2018-12-03 07:22:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:51,691 INFO L480 AbstractCegarLoop]: Abstraction has 6965 states and 23455 transitions. [2018-12-03 07:22:51,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:22:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 23455 transitions. [2018-12-03 07:22:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:51,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:51,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:51,698 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:51,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1740911900, now seen corresponding path program 3 times [2018-12-03 07:22:51,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:51,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:22:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:51,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:22:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:22:51,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:22:51,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 07:22:51,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:22:51,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 07:22:51,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 07:22:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:22:51,785 INFO L87 Difference]: Start difference. First operand 6965 states and 23455 transitions. Second operand 12 states. [2018-12-03 07:22:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:22:52,161 INFO L93 Difference]: Finished difference Result 13529 states and 45706 transitions. [2018-12-03 07:22:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 07:22:52,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-03 07:22:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:22:52,175 INFO L225 Difference]: With dead ends: 13529 [2018-12-03 07:22:52,175 INFO L226 Difference]: Without dead ends: 9625 [2018-12-03 07:22:52,175 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-03 07:22:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2018-12-03 07:22:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 9017. [2018-12-03 07:22:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9017 states. [2018-12-03 07:22:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 29626 transitions. [2018-12-03 07:22:52,271 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 29626 transitions. Word has length 102 [2018-12-03 07:22:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:22:52,271 INFO L480 AbstractCegarLoop]: Abstraction has 9017 states and 29626 transitions. [2018-12-03 07:22:52,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 07:22:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 29626 transitions. [2018-12-03 07:22:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:22:52,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:22:52,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:22:52,281 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:22:52,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:22:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash -141622302, now seen corresponding path program 4 times [2018-12-03 07:22:52,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:22:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:52,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:22:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:22:52,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:22:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:22:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:22:52,324 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:22:52,396 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 07:22:52,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:22:52 BasicIcfg [2018-12-03 07:22:52,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:22:52,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:22:52,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:22:52,398 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:22:52,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:21:40" (3/4) ... [2018-12-03 07:22:52,400 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 07:22:52,475 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ee8ca9dd-4b79-4049-89b5-1ba9f58d1671/bin-2019/utaipan/witness.graphml [2018-12-03 07:22:52,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:22:52,476 INFO L168 Benchmark]: Toolchain (without parser) took 72677.72 ms. Allocated memory was 1.0 GB in the beginning and 7.5 GB in the end (delta: 6.5 GB). Free memory was 949.5 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-03 07:22:52,476 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:22:52,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-03 07:22:52,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.65 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:22:52,477 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 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-03 07:22:52,477 INFO L168 Benchmark]: RCFGBuilder took 339.65 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:22:52,477 INFO L168 Benchmark]: TraceAbstraction took 71883.17 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-12-03 07:22:52,478 INFO L168 Benchmark]: Witness Printer took 77.36 ms. Allocated memory is still 7.5 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:22:52,479 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.65 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.24 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 339.65 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: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71883.17 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 77.36 ms. Allocated memory is still 7.5 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2524; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2524, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t2525; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t2525, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] -1 pthread_t t2526; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] FCALL, FORK -1 pthread_create(&t2526, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L704] 1 z = 2 [L709] 1 __unbuffered_p0_EAX = x [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L721] 2 x = 1 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L729] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L790] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] -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 [L792] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L793] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] -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 [L796] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L797] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L798] -1 y$flush_delayed = weak$$choice2 [L799] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y = !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) [L801] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$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)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$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)) [L803] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -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)) [L804] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$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)) [L805] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -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)) [L806] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] -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)) [L807] -1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] -1 y = y$flush_delayed ? y$mem_tmp : y [L809] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 71.8s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6068 SDtfs, 6234 SDslu, 14236 SDs, 0 SdLazy, 4654 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 81 SyntacticMatches, 16 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, 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: 35.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 387536 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2273 ConstructedInterpolants, 0 QuantifiedInterpolants, 506686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...