./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_rmo.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_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/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 52118bf3184596c6a4ad46bcd92c6308216254cb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:15:49,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:15:49,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:15:49,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:15:49,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:15:49,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:15:49,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:15:49,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:15:49,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:15:49,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:15:49,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:15:49,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:15:49,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:15:49,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:15:49,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:15:49,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:15:49,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:15:49,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:15:49,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:15:49,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:15:49,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:15:49,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:15:49,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:15:49,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:15:49,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:15:49,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:15:49,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:15:49,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:15:49,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:15:49,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:15:49,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:15:49,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:15:49,160 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:15:49,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:15:49,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:15:49,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:15:49,161 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 16:15:49,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:15:49,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:15:49,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:15:49,169 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:15:49,169 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 16:15:49,169 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 16:15:49,169 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 16:15:49,169 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 16:15:49,169 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 16:15:49,169 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 16:15:49,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:15:49,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 16:15:49,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:15:49,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:15:49,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:15:49,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 16:15:49,172 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 16:15:49,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:15:49,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 16:15:49,172 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 16:15:49,172 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_262cbb41-a67a-4603-a05e-4200c7a75a11/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 -> 52118bf3184596c6a4ad46bcd92c6308216254cb [2018-12-08 16:15:49,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:15:49,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:15:49,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:15:49,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:15:49,202 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:15:49,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt_false-unreach-call.i [2018-12-08 16:15:49,244 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/data/bd425864e/f7100b18f99847ceb80563d438f51aed/FLAGb4c28b6d5 [2018-12-08 16:15:49,715 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:15:49,715 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt_false-unreach-call.i [2018-12-08 16:15:49,722 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/data/bd425864e/f7100b18f99847ceb80563d438f51aed/FLAGb4c28b6d5 [2018-12-08 16:15:49,732 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/data/bd425864e/f7100b18f99847ceb80563d438f51aed [2018-12-08 16:15:49,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:15:49,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:15:49,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:15:49,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:15:49,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:15:49,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:15:49" (1/1) ... [2018-12-08 16:15:49,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:49, skipping insertion in model container [2018-12-08 16:15:49,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:15:49" (1/1) ... [2018-12-08 16:15:49,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:15:49,773 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:15:49,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:15:49,982 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:15:50,072 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:15:50,108 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:15:50,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50 WrapperNode [2018-12-08 16:15:50,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:15:50,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:15:50,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:15:50,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:15:50,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:15:50,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:15:50,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:15:50,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:15:50,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... [2018-12-08 16:15:50,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:15:50,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:15:50,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:15:50,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:15:50,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:15:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:15:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:15:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 16:15:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:15:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 16:15:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 16:15:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 16:15:50,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 16:15:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 16:15:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:15:50,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:15:50,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-08 16:15:50,543 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:15:50,543 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 16:15:50,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:15:50 BoogieIcfgContainer [2018-12-08 16:15:50,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:15:50,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:15:50,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:15:50,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:15:50,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:15:49" (1/3) ... [2018-12-08 16:15:50,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568b5bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:15:50, skipping insertion in model container [2018-12-08 16:15:50,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:50" (2/3) ... [2018-12-08 16:15:50,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568b5bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:15:50, skipping insertion in model container [2018-12-08 16:15:50,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:15:50" (3/3) ... [2018-12-08 16:15:50,548 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_rmo.opt_false-unreach-call.i [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,583 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:15:50,604 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 16:15:50,604 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:15:50,609 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 16:15:50,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 16:15:50,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:15:50,634 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 16:15:50,634 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:15:50,634 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:15:50,634 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:15:50,634 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:15:50,634 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:15:50,634 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:15:50,641 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-08 16:15:55,976 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-08 16:15:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-08 16:15:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 16:15:55,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:15:55,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:15:55,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:15:55,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:15:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-08 16:15:55,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:15:56,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:15:56,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:15:56,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:15:56,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:15:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:15:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:15:56,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:15:56,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:15:56,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:15:56,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:15:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:15:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:15:56,153 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-08 16:15:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:15:57,026 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-08 16:15:57,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:15:57,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-08 16:15:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:15:57,390 INFO L225 Difference]: With dead ends: 150583 [2018-12-08 16:15:57,390 INFO L226 Difference]: Without dead ends: 105839 [2018-12-08 16:15:57,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:15:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-08 16:15:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-08 16:15:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-08 16:15:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-08 16:15:59,498 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-08 16:15:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:15:59,498 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-08 16:15:59,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:15:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-08 16:15:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 16:15:59,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:15:59,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:15:59,504 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:15:59,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:15:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-08 16:15:59,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:15:59,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:15:59,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:15:59,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:15:59,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:15:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:15:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:15:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:15:59,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:15:59,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:15:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:15:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:15:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:15:59,553 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-08 16:16:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:00,548 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-08 16:16:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:16:00,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 16:16:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:00,928 INFO L225 Difference]: With dead ends: 146039 [2018-12-08 16:16:00,928 INFO L226 Difference]: Without dead ends: 145471 [2018-12-08 16:16:00,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-08 16:16:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-08 16:16:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-08 16:16:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-08 16:16:05,382 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-08 16:16:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:05,383 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-08 16:16:05,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:16:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-08 16:16:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 16:16:05,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:05,386 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] [2018-12-08 16:16:05,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:05,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1415245602, now seen corresponding path program 1 times [2018-12-08 16:16:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:05,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:05,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:05,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:05,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:05,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:05,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:16:05,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:05,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:16:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:16:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:16:05,447 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-08 16:16:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:06,495 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-08 16:16:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:16:06,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 16:16:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:06,924 INFO L225 Difference]: With dead ends: 199269 [2018-12-08 16:16:06,925 INFO L226 Difference]: Without dead ends: 198805 [2018-12-08 16:16:06,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-08 16:16:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-08 16:16:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-08 16:16:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-08 16:16:10,007 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-08 16:16:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:10,008 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-08 16:16:10,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:16:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-08 16:16:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 16:16:10,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:10,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:10,016 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:10,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1958778492, now seen corresponding path program 1 times [2018-12-08 16:16:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:10,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:10,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:10,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:10,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:10,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:16:10,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:10,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:16:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:16:10,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:10,186 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-08 16:16:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:10,823 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-08 16:16:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:16:10,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-08 16:16:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:11,182 INFO L225 Difference]: With dead ends: 179115 [2018-12-08 16:16:11,183 INFO L226 Difference]: Without dead ends: 179115 [2018-12-08 16:16:11,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-08 16:16:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-08 16:16:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-08 16:16:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-08 16:16:14,715 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-08 16:16:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:14,715 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-08 16:16:14,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:16:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-08 16:16:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 16:16:14,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:14,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:14,730 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:14,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 984479439, now seen corresponding path program 1 times [2018-12-08 16:16:14,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:14,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:14,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:14,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:14,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:14,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:14,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:14,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:14,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:14,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:14,774 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-08 16:16:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:16,476 INFO L93 Difference]: Finished difference Result 315523 states and 1139598 transitions. [2018-12-08 16:16:16,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 16:16:16,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 16:16:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:19,067 INFO L225 Difference]: With dead ends: 315523 [2018-12-08 16:16:19,067 INFO L226 Difference]: Without dead ends: 314987 [2018-12-08 16:16:19,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-08 16:16:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314987 states. [2018-12-08 16:16:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314987 to 164409. [2018-12-08 16:16:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164409 states. [2018-12-08 16:16:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164409 states to 164409 states and 606496 transitions. [2018-12-08 16:16:23,767 INFO L78 Accepts]: Start accepts. Automaton has 164409 states and 606496 transitions. Word has length 53 [2018-12-08 16:16:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:23,768 INFO L480 AbstractCegarLoop]: Abstraction has 164409 states and 606496 transitions. [2018-12-08 16:16:23,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 164409 states and 606496 transitions. [2018-12-08 16:16:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 16:16:23,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:23,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:23,782 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:23,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-08 16:16:23,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:23,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:23,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:23,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:23,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:23,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:23,857 INFO L87 Difference]: Start difference. First operand 164409 states and 606496 transitions. Second operand 6 states. [2018-12-08 16:16:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:25,063 INFO L93 Difference]: Finished difference Result 215866 states and 792770 transitions. [2018-12-08 16:16:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:16:25,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-08 16:16:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:25,533 INFO L225 Difference]: With dead ends: 215866 [2018-12-08 16:16:25,533 INFO L226 Difference]: Without dead ends: 215866 [2018-12-08 16:16:25,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215866 states. [2018-12-08 16:16:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215866 to 201215. [2018-12-08 16:16:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201215 states. [2018-12-08 16:16:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201215 states to 201215 states and 739037 transitions. [2018-12-08 16:16:30,116 INFO L78 Accepts]: Start accepts. Automaton has 201215 states and 739037 transitions. Word has length 53 [2018-12-08 16:16:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:30,117 INFO L480 AbstractCegarLoop]: Abstraction has 201215 states and 739037 transitions. [2018-12-08 16:16:30,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 201215 states and 739037 transitions. [2018-12-08 16:16:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 16:16:30,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:30,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:30,135 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:30,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-08 16:16:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:30,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:30,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:30,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:30,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:16:30,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:30,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:16:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:16:30,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:30,204 INFO L87 Difference]: Start difference. First operand 201215 states and 739037 transitions. Second operand 7 states. [2018-12-08 16:16:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:32,109 INFO L93 Difference]: Finished difference Result 286186 states and 1016985 transitions. [2018-12-08 16:16:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 16:16:32,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-08 16:16:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:32,705 INFO L225 Difference]: With dead ends: 286186 [2018-12-08 16:16:32,705 INFO L226 Difference]: Without dead ends: 286186 [2018-12-08 16:16:32,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 16:16:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286186 states. [2018-12-08 16:16:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286186 to 229832. [2018-12-08 16:16:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229832 states. [2018-12-08 16:16:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229832 states to 229832 states and 831774 transitions. [2018-12-08 16:16:40,942 INFO L78 Accepts]: Start accepts. Automaton has 229832 states and 831774 transitions. Word has length 53 [2018-12-08 16:16:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:40,942 INFO L480 AbstractCegarLoop]: Abstraction has 229832 states and 831774 transitions. [2018-12-08 16:16:40,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:16:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 229832 states and 831774 transitions. [2018-12-08 16:16:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 16:16:40,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:40,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:40,960 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:40,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-08 16:16:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:40,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:16:40,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:40,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:16:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:16:40,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:16:40,985 INFO L87 Difference]: Start difference. First operand 229832 states and 831774 transitions. Second operand 4 states. [2018-12-08 16:16:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:41,122 INFO L93 Difference]: Finished difference Result 38679 states and 122684 transitions. [2018-12-08 16:16:41,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:16:41,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-08 16:16:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:41,165 INFO L225 Difference]: With dead ends: 38679 [2018-12-08 16:16:41,166 INFO L226 Difference]: Without dead ends: 32083 [2018-12-08 16:16:41,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:16:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32083 states. [2018-12-08 16:16:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32083 to 31836. [2018-12-08 16:16:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2018-12-08 16:16:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 99515 transitions. [2018-12-08 16:16:41,519 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 99515 transitions. Word has length 53 [2018-12-08 16:16:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:41,520 INFO L480 AbstractCegarLoop]: Abstraction has 31836 states and 99515 transitions. [2018-12-08 16:16:41,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:16:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 99515 transitions. [2018-12-08 16:16:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 16:16:41,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:41,524 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] [2018-12-08 16:16:41,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:41,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -917178143, now seen corresponding path program 1 times [2018-12-08 16:16:41,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:41,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:41,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:41,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:41,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:16:41,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:41,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:16:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:16:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:16:41,566 INFO L87 Difference]: Start difference. First operand 31836 states and 99515 transitions. Second operand 4 states. [2018-12-08 16:16:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:41,783 INFO L93 Difference]: Finished difference Result 41208 states and 129949 transitions. [2018-12-08 16:16:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:16:41,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 16:16:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:41,836 INFO L225 Difference]: With dead ends: 41208 [2018-12-08 16:16:41,836 INFO L226 Difference]: Without dead ends: 41208 [2018-12-08 16:16:41,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:16:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41208 states. [2018-12-08 16:16:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41208 to 35932. [2018-12-08 16:16:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35932 states. [2018-12-08 16:16:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35932 states to 35932 states and 112644 transitions. [2018-12-08 16:16:42,265 INFO L78 Accepts]: Start accepts. Automaton has 35932 states and 112644 transitions. Word has length 63 [2018-12-08 16:16:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:42,265 INFO L480 AbstractCegarLoop]: Abstraction has 35932 states and 112644 transitions. [2018-12-08 16:16:42,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:16:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 35932 states and 112644 transitions. [2018-12-08 16:16:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 16:16:42,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:42,271 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] [2018-12-08 16:16:42,271 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:42,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 825632192, now seen corresponding path program 1 times [2018-12-08 16:16:42,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:42,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:42,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:42,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:42,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:42,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:42,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:42,310 INFO L87 Difference]: Start difference. First operand 35932 states and 112644 transitions. Second operand 6 states. [2018-12-08 16:16:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:42,857 INFO L93 Difference]: Finished difference Result 72509 states and 225560 transitions. [2018-12-08 16:16:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 16:16:42,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-08 16:16:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:42,966 INFO L225 Difference]: With dead ends: 72509 [2018-12-08 16:16:42,966 INFO L226 Difference]: Without dead ends: 72445 [2018-12-08 16:16:42,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 16:16:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72445 states. [2018-12-08 16:16:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72445 to 40892. [2018-12-08 16:16:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40892 states. [2018-12-08 16:16:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40892 states to 40892 states and 126622 transitions. [2018-12-08 16:16:43,710 INFO L78 Accepts]: Start accepts. Automaton has 40892 states and 126622 transitions. Word has length 63 [2018-12-08 16:16:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:43,710 INFO L480 AbstractCegarLoop]: Abstraction has 40892 states and 126622 transitions. [2018-12-08 16:16:43,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 40892 states and 126622 transitions. [2018-12-08 16:16:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 16:16:43,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:43,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:43,721 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:43,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1816196687, now seen corresponding path program 1 times [2018-12-08 16:16:43,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:43,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:43,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:43,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-08 16:16:43,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:43,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:16:43,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:43,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:16:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:16:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:43,740 INFO L87 Difference]: Start difference. First operand 40892 states and 126622 transitions. Second operand 3 states. [2018-12-08 16:16:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:43,872 INFO L93 Difference]: Finished difference Result 46897 states and 143099 transitions. [2018-12-08 16:16:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:16:43,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 16:16:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:43,929 INFO L225 Difference]: With dead ends: 46897 [2018-12-08 16:16:43,929 INFO L226 Difference]: Without dead ends: 46897 [2018-12-08 16:16:43,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2018-12-08 16:16:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 40580. [2018-12-08 16:16:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40580 states. [2018-12-08 16:16:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 123024 transitions. [2018-12-08 16:16:44,416 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 123024 transitions. Word has length 69 [2018-12-08 16:16:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:44,417 INFO L480 AbstractCegarLoop]: Abstraction has 40580 states and 123024 transitions. [2018-12-08 16:16:44,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:16:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 123024 transitions. [2018-12-08 16:16:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 16:16:44,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:44,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:44,426 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:44,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1992546375, now seen corresponding path program 1 times [2018-12-08 16:16:44,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:44,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:44,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:44,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:44,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:44,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:44,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:16:44,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:44,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:16:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:16:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:44,487 INFO L87 Difference]: Start difference. First operand 40580 states and 123024 transitions. Second operand 7 states. [2018-12-08 16:16:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:45,341 INFO L93 Difference]: Finished difference Result 56545 states and 170864 transitions. [2018-12-08 16:16:45,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 16:16:45,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-08 16:16:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:45,413 INFO L225 Difference]: With dead ends: 56545 [2018-12-08 16:16:45,413 INFO L226 Difference]: Without dead ends: 56241 [2018-12-08 16:16:45,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 16:16:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56241 states. [2018-12-08 16:16:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56241 to 47672. [2018-12-08 16:16:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2018-12-08 16:16:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2018-12-08 16:16:45,983 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2018-12-08 16:16:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:45,984 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2018-12-08 16:16:45,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:16:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2018-12-08 16:16:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 16:16:45,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:45,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:45,996 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:45,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash 505469562, now seen corresponding path program 1 times [2018-12-08 16:16:45,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:45,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:45,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:46,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:46,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:16:46,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:16:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:16:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:46,065 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2018-12-08 16:16:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:47,002 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2018-12-08 16:16:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:16:47,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-12-08 16:16:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:47,063 INFO L225 Difference]: With dead ends: 57838 [2018-12-08 16:16:47,063 INFO L226 Difference]: Without dead ends: 57838 [2018-12-08 16:16:47,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:16:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2018-12-08 16:16:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2018-12-08 16:16:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2018-12-08 16:16:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2018-12-08 16:16:47,645 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2018-12-08 16:16:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:47,645 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2018-12-08 16:16:47,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:16:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2018-12-08 16:16:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 16:16:47,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:47,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:47,658 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:47,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1392973243, now seen corresponding path program 1 times [2018-12-08 16:16:47,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:47,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:47,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:47,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:47,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:16:47,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:47,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:16:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:16:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:16:47,693 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2018-12-08 16:16:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:47,753 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2018-12-08 16:16:47,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:16:47,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 16:16:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:47,763 INFO L225 Difference]: With dead ends: 13236 [2018-12-08 16:16:47,763 INFO L226 Difference]: Without dead ends: 11116 [2018-12-08 16:16:47,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2018-12-08 16:16:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2018-12-08 16:16:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-12-08 16:16:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2018-12-08 16:16:47,841 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2018-12-08 16:16:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:47,841 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2018-12-08 16:16:47,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:16:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2018-12-08 16:16:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 16:16:47,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:47,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:47,847 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:47,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:47,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1668171352, now seen corresponding path program 1 times [2018-12-08 16:16:47,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:47,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:47,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:47,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:47,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:47,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:47,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:16:47,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:47,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:16:47,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:16:47,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:16:47,894 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2018-12-08 16:16:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:48,023 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2018-12-08 16:16:48,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:16:48,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-08 16:16:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:48,030 INFO L225 Difference]: With dead ends: 9960 [2018-12-08 16:16:48,030 INFO L226 Difference]: Without dead ends: 9960 [2018-12-08 16:16:48,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:16:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2018-12-08 16:16:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2018-12-08 16:16:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-08 16:16:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2018-12-08 16:16:48,111 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2018-12-08 16:16:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:48,112 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2018-12-08 16:16:48,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:16:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2018-12-08 16:16:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 16:16:48,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:48,118 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-08 16:16:48,118 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:48,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 549586601, now seen corresponding path program 1 times [2018-12-08 16:16:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:48,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:48,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:48,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:16:48,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:48,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:16:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:16:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:48,141 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 3 states. [2018-12-08 16:16:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:48,282 INFO L93 Difference]: Finished difference Result 12725 states and 30850 transitions. [2018-12-08 16:16:48,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:16:48,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-08 16:16:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:48,290 INFO L225 Difference]: With dead ends: 12725 [2018-12-08 16:16:48,291 INFO L226 Difference]: Without dead ends: 12725 [2018-12-08 16:16:48,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:16:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12725 states. [2018-12-08 16:16:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12725 to 11524. [2018-12-08 16:16:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11524 states. [2018-12-08 16:16:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11524 states to 11524 states and 28181 transitions. [2018-12-08 16:16:48,385 INFO L78 Accepts]: Start accepts. Automaton has 11524 states and 28181 transitions. Word has length 98 [2018-12-08 16:16:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:48,385 INFO L480 AbstractCegarLoop]: Abstraction has 11524 states and 28181 transitions. [2018-12-08 16:16:48,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:16:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11524 states and 28181 transitions. [2018-12-08 16:16:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 16:16:48,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:48,393 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-08 16:16:48,393 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:48,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2080182649, now seen corresponding path program 2 times [2018-12-08 16:16:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:48,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:48,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:48,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:48,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:48,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:48,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:48,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:48,444 INFO L87 Difference]: Start difference. First operand 11524 states and 28181 transitions. Second operand 6 states. [2018-12-08 16:16:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:48,775 INFO L93 Difference]: Finished difference Result 14264 states and 34204 transitions. [2018-12-08 16:16:48,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:16:48,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-08 16:16:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:48,784 INFO L225 Difference]: With dead ends: 14264 [2018-12-08 16:16:48,785 INFO L226 Difference]: Without dead ends: 14264 [2018-12-08 16:16:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2018-12-08 16:16:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 11317. [2018-12-08 16:16:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-12-08 16:16:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 27219 transitions. [2018-12-08 16:16:48,885 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 27219 transitions. Word has length 98 [2018-12-08 16:16:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:48,885 INFO L480 AbstractCegarLoop]: Abstraction has 11317 states and 27219 transitions. [2018-12-08 16:16:48,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 27219 transitions. [2018-12-08 16:16:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 16:16:48,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:48,893 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-08 16:16:48,894 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:48,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -789451851, now seen corresponding path program 1 times [2018-12-08 16:16:48,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:48,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:48,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:48,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:48,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:48,983 INFO L87 Difference]: Start difference. First operand 11317 states and 27219 transitions. Second operand 6 states. [2018-12-08 16:16:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:49,226 INFO L93 Difference]: Finished difference Result 13695 states and 32744 transitions. [2018-12-08 16:16:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:16:49,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 16:16:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:49,238 INFO L225 Difference]: With dead ends: 13695 [2018-12-08 16:16:49,238 INFO L226 Difference]: Without dead ends: 13663 [2018-12-08 16:16:49,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2018-12-08 16:16:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 12238. [2018-12-08 16:16:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12238 states. [2018-12-08 16:16:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12238 states to 12238 states and 29366 transitions. [2018-12-08 16:16:49,343 INFO L78 Accepts]: Start accepts. Automaton has 12238 states and 29366 transitions. Word has length 100 [2018-12-08 16:16:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:49,343 INFO L480 AbstractCegarLoop]: Abstraction has 12238 states and 29366 transitions. [2018-12-08 16:16:49,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12238 states and 29366 transitions. [2018-12-08 16:16:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 16:16:49,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:49,352 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-08 16:16:49,352 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:49,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1708564086, now seen corresponding path program 1 times [2018-12-08 16:16:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:49,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:49,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:16:49,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:49,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:16:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:16:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:49,414 INFO L87 Difference]: Start difference. First operand 12238 states and 29366 transitions. Second operand 7 states. [2018-12-08 16:16:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:49,765 INFO L93 Difference]: Finished difference Result 18053 states and 43645 transitions. [2018-12-08 16:16:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:16:49,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-08 16:16:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:49,778 INFO L225 Difference]: With dead ends: 18053 [2018-12-08 16:16:49,778 INFO L226 Difference]: Without dead ends: 18053 [2018-12-08 16:16:49,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:16:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2018-12-08 16:16:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 12767. [2018-12-08 16:16:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2018-12-08 16:16:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 30777 transitions. [2018-12-08 16:16:49,907 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 30777 transitions. Word has length 100 [2018-12-08 16:16:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:49,907 INFO L480 AbstractCegarLoop]: Abstraction has 12767 states and 30777 transitions. [2018-12-08 16:16:49,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:16:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 30777 transitions. [2018-12-08 16:16:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 16:16:49,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:49,918 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-08 16:16:49,918 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:49,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1698899529, now seen corresponding path program 1 times [2018-12-08 16:16:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:49,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:49,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:49,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:49,968 INFO L87 Difference]: Start difference. First operand 12767 states and 30777 transitions. Second operand 6 states. [2018-12-08 16:16:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:50,155 INFO L93 Difference]: Finished difference Result 15015 states and 35894 transitions. [2018-12-08 16:16:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:16:50,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 16:16:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:50,166 INFO L225 Difference]: With dead ends: 15015 [2018-12-08 16:16:50,166 INFO L226 Difference]: Without dead ends: 15015 [2018-12-08 16:16:50,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2018-12-08 16:16:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 13041. [2018-12-08 16:16:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13041 states. [2018-12-08 16:16:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13041 states to 13041 states and 31436 transitions. [2018-12-08 16:16:50,283 INFO L78 Accepts]: Start accepts. Automaton has 13041 states and 31436 transitions. Word has length 100 [2018-12-08 16:16:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:50,283 INFO L480 AbstractCegarLoop]: Abstraction has 13041 states and 31436 transitions. [2018-12-08 16:16:50,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13041 states and 31436 transitions. [2018-12-08 16:16:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 16:16:50,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:50,293 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-08 16:16:50,294 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:50,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash -329492203, now seen corresponding path program 1 times [2018-12-08 16:16:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:50,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:50,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:50,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:50,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:16:50,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:50,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:16:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:16:50,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:50,379 INFO L87 Difference]: Start difference. First operand 13041 states and 31436 transitions. Second operand 6 states. [2018-12-08 16:16:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:50,482 INFO L93 Difference]: Finished difference Result 12769 states and 30484 transitions. [2018-12-08 16:16:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:16:50,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-08 16:16:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:50,491 INFO L225 Difference]: With dead ends: 12769 [2018-12-08 16:16:50,491 INFO L226 Difference]: Without dead ends: 12769 [2018-12-08 16:16:50,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12769 states. [2018-12-08 16:16:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12769 to 10327. [2018-12-08 16:16:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10327 states. [2018-12-08 16:16:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 24777 transitions. [2018-12-08 16:16:50,590 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 24777 transitions. Word has length 100 [2018-12-08 16:16:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:50,590 INFO L480 AbstractCegarLoop]: Abstraction has 10327 states and 24777 transitions. [2018-12-08 16:16:50,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:16:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 24777 transitions. [2018-12-08 16:16:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 16:16:50,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:50,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:50,597 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:50,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1824196817, now seen corresponding path program 1 times [2018-12-08 16:16:50,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:50,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:50,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:50,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:50,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:50,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:16:50,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:50,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:16:50,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:16:50,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:16:50,635 INFO L87 Difference]: Start difference. First operand 10327 states and 24777 transitions. Second operand 5 states. [2018-12-08 16:16:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:50,807 INFO L93 Difference]: Finished difference Result 12330 states and 29018 transitions. [2018-12-08 16:16:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:16:50,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 16:16:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:50,816 INFO L225 Difference]: With dead ends: 12330 [2018-12-08 16:16:50,816 INFO L226 Difference]: Without dead ends: 12330 [2018-12-08 16:16:50,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12330 states. [2018-12-08 16:16:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12330 to 10500. [2018-12-08 16:16:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2018-12-08 16:16:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 25146 transitions. [2018-12-08 16:16:50,913 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 25146 transitions. Word has length 100 [2018-12-08 16:16:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:50,913 INFO L480 AbstractCegarLoop]: Abstraction has 10500 states and 25146 transitions. [2018-12-08 16:16:50,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:16:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 25146 transitions. [2018-12-08 16:16:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:50,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:50,921 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-08 16:16:50,921 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:50,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -309091398, now seen corresponding path program 1 times [2018-12-08 16:16:50,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:50,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:50,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:50,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:16:50,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:50,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:16:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:16:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:50,985 INFO L87 Difference]: Start difference. First operand 10500 states and 25146 transitions. Second operand 8 states. [2018-12-08 16:16:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:51,887 INFO L93 Difference]: Finished difference Result 18823 states and 44161 transitions. [2018-12-08 16:16:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 16:16:51,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-08 16:16:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:51,900 INFO L225 Difference]: With dead ends: 18823 [2018-12-08 16:16:51,900 INFO L226 Difference]: Without dead ends: 18728 [2018-12-08 16:16:51,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-08 16:16:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18728 states. [2018-12-08 16:16:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18728 to 13537. [2018-12-08 16:16:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13537 states. [2018-12-08 16:16:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13537 states to 13537 states and 32323 transitions. [2018-12-08 16:16:52,035 INFO L78 Accepts]: Start accepts. Automaton has 13537 states and 32323 transitions. Word has length 102 [2018-12-08 16:16:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:52,035 INFO L480 AbstractCegarLoop]: Abstraction has 13537 states and 32323 transitions. [2018-12-08 16:16:52,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:16:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 13537 states and 32323 transitions. [2018-12-08 16:16:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:52,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:52,045 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-08 16:16:52,045 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:52,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1908666555, now seen corresponding path program 1 times [2018-12-08 16:16:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:52,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:52,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:52,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:52,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:52,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:16:52,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:52,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:16:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:16:52,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:52,122 INFO L87 Difference]: Start difference. First operand 13537 states and 32323 transitions. Second operand 7 states. [2018-12-08 16:16:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:52,419 INFO L93 Difference]: Finished difference Result 18636 states and 43263 transitions. [2018-12-08 16:16:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 16:16:52,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 16:16:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:52,432 INFO L225 Difference]: With dead ends: 18636 [2018-12-08 16:16:52,432 INFO L226 Difference]: Without dead ends: 18636 [2018-12-08 16:16:52,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:16:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18636 states. [2018-12-08 16:16:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18636 to 15989. [2018-12-08 16:16:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15989 states. [2018-12-08 16:16:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15989 states to 15989 states and 37604 transitions. [2018-12-08 16:16:52,580 INFO L78 Accepts]: Start accepts. Automaton has 15989 states and 37604 transitions. Word has length 102 [2018-12-08 16:16:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:52,581 INFO L480 AbstractCegarLoop]: Abstraction has 15989 states and 37604 transitions. [2018-12-08 16:16:52,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:16:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15989 states and 37604 transitions. [2018-12-08 16:16:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:52,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:52,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:52,593 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:52,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2120017468, now seen corresponding path program 1 times [2018-12-08 16:16:52,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:52,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:52,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:52,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:52,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:16:52,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:52,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:16:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:16:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:52,679 INFO L87 Difference]: Start difference. First operand 15989 states and 37604 transitions. Second operand 7 states. [2018-12-08 16:16:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:52,854 INFO L93 Difference]: Finished difference Result 16663 states and 39077 transitions. [2018-12-08 16:16:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:16:52,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 16:16:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:52,866 INFO L225 Difference]: With dead ends: 16663 [2018-12-08 16:16:52,866 INFO L226 Difference]: Without dead ends: 16663 [2018-12-08 16:16:52,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-08 16:16:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16663 states. [2018-12-08 16:16:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16663 to 16516. [2018-12-08 16:16:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16516 states. [2018-12-08 16:16:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16516 states to 16516 states and 38784 transitions. [2018-12-08 16:16:53,002 INFO L78 Accepts]: Start accepts. Automaton has 16516 states and 38784 transitions. Word has length 102 [2018-12-08 16:16:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:53,002 INFO L480 AbstractCegarLoop]: Abstraction has 16516 states and 38784 transitions. [2018-12-08 16:16:53,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:16:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 16516 states and 38784 transitions. [2018-12-08 16:16:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:53,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:53,015 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-08 16:16:53,015 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:53,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1287446147, now seen corresponding path program 1 times [2018-12-08 16:16:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:53,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:16:53,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:53,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:16:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:16:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:16:53,099 INFO L87 Difference]: Start difference. First operand 16516 states and 38784 transitions. Second operand 9 states. [2018-12-08 16:16:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:53,242 INFO L93 Difference]: Finished difference Result 20356 states and 48058 transitions. [2018-12-08 16:16:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:16:53,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-12-08 16:16:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:53,245 INFO L225 Difference]: With dead ends: 20356 [2018-12-08 16:16:53,245 INFO L226 Difference]: Without dead ends: 4035 [2018-12-08 16:16:53,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-08 16:16:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2018-12-08 16:16:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 4033. [2018-12-08 16:16:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2018-12-08 16:16:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 9587 transitions. [2018-12-08 16:16:53,270 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 9587 transitions. Word has length 102 [2018-12-08 16:16:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:53,270 INFO L480 AbstractCegarLoop]: Abstraction has 4033 states and 9587 transitions. [2018-12-08 16:16:53,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:16:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 9587 transitions. [2018-12-08 16:16:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:53,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:53,273 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-08 16:16:53,273 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:53,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1406724183, now seen corresponding path program 1 times [2018-12-08 16:16:53,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:53,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:16:53,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:53,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:16:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:16:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:16:53,307 INFO L87 Difference]: Start difference. First operand 4033 states and 9587 transitions. Second operand 5 states. [2018-12-08 16:16:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:53,413 INFO L93 Difference]: Finished difference Result 4506 states and 10608 transitions. [2018-12-08 16:16:53,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:16:53,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-08 16:16:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:53,416 INFO L225 Difference]: With dead ends: 4506 [2018-12-08 16:16:53,416 INFO L226 Difference]: Without dead ends: 4472 [2018-12-08 16:16:53,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:16:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2018-12-08 16:16:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 4081. [2018-12-08 16:16:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4081 states. [2018-12-08 16:16:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 9696 transitions. [2018-12-08 16:16:53,446 INFO L78 Accepts]: Start accepts. Automaton has 4081 states and 9696 transitions. Word has length 102 [2018-12-08 16:16:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:53,446 INFO L480 AbstractCegarLoop]: Abstraction has 4081 states and 9696 transitions. [2018-12-08 16:16:53,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:16:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 9696 transitions. [2018-12-08 16:16:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:53,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:53,449 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-08 16:16:53,449 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:53,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1370737237, now seen corresponding path program 1 times [2018-12-08 16:16:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:53,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:53,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:16:53,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:53,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:16:53,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:16:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:16:53,511 INFO L87 Difference]: Start difference. First operand 4081 states and 9696 transitions. Second operand 7 states. [2018-12-08 16:16:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:53,669 INFO L93 Difference]: Finished difference Result 4528 states and 10637 transitions. [2018-12-08 16:16:53,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:16:53,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 16:16:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:53,672 INFO L225 Difference]: With dead ends: 4528 [2018-12-08 16:16:53,672 INFO L226 Difference]: Without dead ends: 4528 [2018-12-08 16:16:53,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2018-12-08 16:16:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4023. [2018-12-08 16:16:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4023 states. [2018-12-08 16:16:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 9578 transitions. [2018-12-08 16:16:53,702 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 9578 transitions. Word has length 102 [2018-12-08 16:16:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:53,702 INFO L480 AbstractCegarLoop]: Abstraction has 4023 states and 9578 transitions. [2018-12-08 16:16:53,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:16:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 9578 transitions. [2018-12-08 16:16:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:53,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:53,705 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-08 16:16:53,705 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:53,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1462650060, now seen corresponding path program 2 times [2018-12-08 16:16:53,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:53,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:53,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:16:53,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:53,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:16:53,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:16:53,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:16:53,790 INFO L87 Difference]: Start difference. First operand 4023 states and 9578 transitions. Second operand 8 states. [2018-12-08 16:16:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:53,950 INFO L93 Difference]: Finished difference Result 4428 states and 10508 transitions. [2018-12-08 16:16:53,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 16:16:53,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-08 16:16:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:53,953 INFO L225 Difference]: With dead ends: 4428 [2018-12-08 16:16:53,953 INFO L226 Difference]: Without dead ends: 4428 [2018-12-08 16:16:53,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-08 16:16:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2018-12-08 16:16:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4012. [2018-12-08 16:16:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2018-12-08 16:16:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 9544 transitions. [2018-12-08 16:16:53,980 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 9544 transitions. Word has length 102 [2018-12-08 16:16:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:53,980 INFO L480 AbstractCegarLoop]: Abstraction has 4012 states and 9544 transitions. [2018-12-08 16:16:53,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:16:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 9544 transitions. [2018-12-08 16:16:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:53,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:53,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:53,982 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:53,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:53,983 INFO L82 PathProgramCache]: Analyzing trace with hash -575146379, now seen corresponding path program 2 times [2018-12-08 16:16:53,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:53,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:53,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:54,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:54,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 16:16:54,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:16:54,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 16:16:54,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 16:16:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 16:16:54,083 INFO L87 Difference]: Start difference. First operand 4012 states and 9544 transitions. Second operand 13 states. [2018-12-08 16:16:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:54,488 INFO L93 Difference]: Finished difference Result 6515 states and 15257 transitions. [2018-12-08 16:16:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 16:16:54,489 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-08 16:16:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:16:54,492 INFO L225 Difference]: With dead ends: 6515 [2018-12-08 16:16:54,492 INFO L226 Difference]: Without dead ends: 4669 [2018-12-08 16:16:54,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-08 16:16:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2018-12-08 16:16:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4068. [2018-12-08 16:16:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2018-12-08 16:16:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 9606 transitions. [2018-12-08 16:16:54,521 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 9606 transitions. Word has length 102 [2018-12-08 16:16:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:16:54,521 INFO L480 AbstractCegarLoop]: Abstraction has 4068 states and 9606 transitions. [2018-12-08 16:16:54,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 16:16:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 9606 transitions. [2018-12-08 16:16:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 16:16:54,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:16:54,524 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-08 16:16:54,524 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:16:54,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 712190995, now seen corresponding path program 3 times [2018-12-08 16:16:54,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:16:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:54,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:54,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:16:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:54,559 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 16:16:54,624 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 16:16:54,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:16:54 BasicIcfg [2018-12-08 16:16:54,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:16:54,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:16:54,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:16:54,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:16:54,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:15:50" (3/4) ... [2018-12-08 16:16:54,627 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 16:16:54,701 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_262cbb41-a67a-4603-a05e-4200c7a75a11/bin-2019/utaipan/witness.graphml [2018-12-08 16:16:54,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:16:54,701 INFO L168 Benchmark]: Toolchain (without parser) took 64966.53 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 948.1 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,702 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:16:54,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,703 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,703 INFO L168 Benchmark]: RCFGBuilder took 367.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,703 INFO L168 Benchmark]: TraceAbstraction took 64081.38 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,703 INFO L168 Benchmark]: Witness Printer took 75.53 ms. Allocated memory is still 7.3 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:54,704 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.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 367.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64081.38 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 75.53 ms. Allocated memory is still 7.3 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1773; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1774; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -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) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -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 [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -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 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 63.9s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11177 SDtfs, 14105 SDslu, 28942 SDs, 0 SdLazy, 11284 SolverSat, 700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 73 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229832occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 35.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 510386 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2509 NumberOfCodeBlocks, 2509 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2377 ConstructedInterpolants, 0 QuantifiedInterpolants, 498443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...