./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_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_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/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 a5966613af1185b918f46972f86c0f734775634b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 14:27:34,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:27:34,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:27:34,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:27:34,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:27:34,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:27:34,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:27:34,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:27:34,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:27:34,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:27:34,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:27:34,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:27:34,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:27:34,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:27:34,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:27:34,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:27:34,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:27:34,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:27:34,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:27:34,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:27:34,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:27:34,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:27:34,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:27:34,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:27:34,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:27:34,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:27:34,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:27:34,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:27:34,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:27:34,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:27:34,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:27:34,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:27:34,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:27:34,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:27:34,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:27:34,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:27:34,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:27:34,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:27:34,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:27:34,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:27:34,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:27:34,303 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:27:34,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:27:34,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:27:34,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:27:34,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:27:34,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:27:34,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:27:34,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:27:34,306 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_477e5790-9054-4605-a25a-fb7a52b110d5/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 -> a5966613af1185b918f46972f86c0f734775634b [2018-12-02 14:27:34,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:27:34,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:27:34,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:27:34,331 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:27:34,332 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:27:34,332 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt_false-unreach-call.i [2018-12-02 14:27:34,366 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/data/1ab902d2f/5b858a488970427cbcbc59c13c85eed7/FLAG9c70cb865 [2018-12-02 14:27:34,794 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:27:34,795 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt_false-unreach-call.i [2018-12-02 14:27:34,805 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/data/1ab902d2f/5b858a488970427cbcbc59c13c85eed7/FLAG9c70cb865 [2018-12-02 14:27:34,815 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/data/1ab902d2f/5b858a488970427cbcbc59c13c85eed7 [2018-12-02 14:27:34,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:27:34,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:27:34,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:27:34,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:27:34,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:27:34,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:27:34" (1/1) ... [2018-12-02 14:27:34,824 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 02.12 02:27:34, skipping insertion in model container [2018-12-02 14:27:34,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:27:34" (1/1) ... [2018-12-02 14:27:34,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:27:34,858 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:27:35,053 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:27:35,060 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:27:35,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:27:35,170 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:27:35,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35 WrapperNode [2018-12-02 14:27:35,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:27:35,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:27:35,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:27:35,171 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:27:35,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:27:35,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:27:35,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:27:35,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:27:35,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... [2018-12-02 14:27:35,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:27:35,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:27:35,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:27:35,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:27:35,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/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-02 14:27:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:27:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:27:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 14:27:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:27:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 14:27:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 14:27:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 14:27:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 14:27:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 14:27:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:27:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:27:35,255 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 14:27:35,541 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:27:35,541 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 14:27:35,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:27:35 BoogieIcfgContainer [2018-12-02 14:27:35,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:27:35,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:27:35,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:27:35,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:27:35,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:27:34" (1/3) ... [2018-12-02 14:27:35,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144e595e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:27:35, skipping insertion in model container [2018-12-02 14:27:35,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:27:35" (2/3) ... [2018-12-02 14:27:35,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144e595e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:27:35, skipping insertion in model container [2018-12-02 14:27:35,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:27:35" (3/3) ... [2018-12-02 14:27:35,546 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt_false-unreach-call.i [2018-12-02 14:27:35,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,570 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,570 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,570 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,571 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,571 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,581 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,582 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,583 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,584 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:27:35,596 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 14:27:35,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:27:35,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 14:27:35,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 14:27:35,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:27:35,625 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:27:35,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:27:35,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:27:35,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:27:35,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:27:35,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:27:35,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:27:35,632 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 14:27:37,144 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-02 14:27:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-02 14:27:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 14:27:37,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:37,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:37,152 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:37,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2018-12-02 14:27:37,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:37,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:37,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:37,286 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-02 14:27:37,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:37,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:37,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:37,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:37,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:37,301 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-02 14:27:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:37,798 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-02 14:27:37,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:27:37,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 14:27:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:37,949 INFO L225 Difference]: With dead ends: 60790 [2018-12-02 14:27:37,950 INFO L226 Difference]: Without dead ends: 44270 [2018-12-02 14:27:37,951 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-02 14:27:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-02 14:27:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-02 14:27:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-02 14:27:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-02 14:27:38,698 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-02 14:27:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:38,698 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-02 14:27:38,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-02 14:27:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 14:27:38,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:38,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] [2018-12-02 14:27:38,705 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:38,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2018-12-02 14:27:38,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:38,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:38,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:38,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:27:38,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:38,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:38,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:38,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:38,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:38,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:38,771 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-02 14:27:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:38,831 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-02 14:27:38,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:27:38,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 14:27:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:38,846 INFO L225 Difference]: With dead ends: 8528 [2018-12-02 14:27:38,846 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 14:27:38,846 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-02 14:27:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 14:27:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-02 14:27:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-02 14:27:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-02 14:27:38,932 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-02 14:27:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:38,933 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-02 14:27:38,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:38,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-02 14:27:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 14:27:38,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:38,934 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-02 14:27:38,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:38,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:38,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2018-12-02 14:27:38,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:38,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:38,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:38,988 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-02 14:27:38,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:38,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:38,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:38,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:38,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:38,989 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-02 14:27:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:39,185 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-02 14:27:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:39,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 14:27:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:39,247 INFO L225 Difference]: With dead ends: 13998 [2018-12-02 14:27:39,247 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 14:27:39,248 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-02 14:27:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 14:27:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-02 14:27:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 14:27:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-02 14:27:39,364 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-02 14:27:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:39,365 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-02 14:27:39,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-02 14:27:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 14:27:39,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:39,366 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] [2018-12-02 14:27:39,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:39,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2018-12-02 14:27:39,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:39,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:39,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:39,398 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-02 14:27:39,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:39,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:27:39,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:39,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:27:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:27:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:27:39,399 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-02 14:27:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:39,458 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-02 14:27:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:27:39,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 14:27:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:39,476 INFO L225 Difference]: With dead ends: 13279 [2018-12-02 14:27:39,476 INFO L226 Difference]: Without dead ends: 13279 [2018-12-02 14:27:39,477 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-02 14:27:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-02 14:27:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-02 14:27:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-02 14:27:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-02 14:27:39,605 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-02 14:27:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:39,605 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-02 14:27:39,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:27:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-02 14:27:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 14:27:39,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:39,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:39,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:39,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2018-12-02 14:27:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:39,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:39,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:39,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:39,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:39,687 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-02 14:27:39,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:39,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:27:39,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:39,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:27:39,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:27:39,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:39,688 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-02 14:27:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:40,150 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-02 14:27:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:27:40,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 14:27:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:40,163 INFO L225 Difference]: With dead ends: 12285 [2018-12-02 14:27:40,164 INFO L226 Difference]: Without dead ends: 12213 [2018-12-02 14:27:40,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:27:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-02 14:27:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-02 14:27:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-02 14:27:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-02 14:27:40,311 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-02 14:27:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:40,311 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-02 14:27:40,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:27:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-02 14:27:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 14:27:40,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:40,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:40,314 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:40,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2018-12-02 14:27:40,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:40,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:40,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:40,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:40,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:40,363 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-02 14:27:40,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:40,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:40,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:40,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:40,364 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-02 14:27:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:40,440 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-02 14:27:40,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:27:40,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 14:27:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:40,454 INFO L225 Difference]: With dead ends: 12396 [2018-12-02 14:27:40,455 INFO L226 Difference]: Without dead ends: 12396 [2018-12-02 14:27:40,455 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-02 14:27:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-02 14:27:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-02 14:27:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-02 14:27:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-02 14:27:40,577 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-02 14:27:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:40,578 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-02 14:27:40,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-02 14:27:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 14:27:40,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:40,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:40,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:40,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2018-12-02 14:27:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:40,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:40,628 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-02 14:27:40,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:40,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:27:40,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:40,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:27:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:27:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:27:40,628 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-02 14:27:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:40,900 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-02 14:27:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:27:40,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 14:27:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:40,924 INFO L225 Difference]: With dead ends: 20969 [2018-12-02 14:27:40,924 INFO L226 Difference]: Without dead ends: 20898 [2018-12-02 14:27:40,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:27:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-02 14:27:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-02 14:27:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-02 14:27:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-02 14:27:41,104 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-02 14:27:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:41,105 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-02 14:27:41,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:27:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-02 14:27:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 14:27:41,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:41,109 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] [2018-12-02 14:27:41,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:41,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1900874254, now seen corresponding path program 1 times [2018-12-02 14:27:41,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:41,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:41,142 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-02 14:27:41,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:41,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:41,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:41,143 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-02 14:27:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:41,435 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-02 14:27:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:27:41,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 14:27:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:41,463 INFO L225 Difference]: With dead ends: 23352 [2018-12-02 14:27:41,463 INFO L226 Difference]: Without dead ends: 23352 [2018-12-02 14:27:41,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-02 14:27:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-02 14:27:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-02 14:27:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-02 14:27:41,694 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-02 14:27:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:41,695 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-02 14:27:41,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-02 14:27:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 14:27:41,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:41,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:41,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:41,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2100690035, now seen corresponding path program 1 times [2018-12-02 14:27:41,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:41,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:41,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:41,735 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-02 14:27:41,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:41,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:41,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:41,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:41,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:41,735 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-02 14:27:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:41,911 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-02 14:27:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:27:41,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 14:27:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:41,932 INFO L225 Difference]: With dead ends: 18411 [2018-12-02 14:27:41,933 INFO L226 Difference]: Without dead ends: 18411 [2018-12-02 14:27:41,933 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-02 14:27:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-02 14:27:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-02 14:27:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-02 14:27:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-02 14:27:42,114 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-02 14:27:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:42,114 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-02 14:27:42,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-02 14:27:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 14:27:42,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:42,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:42,120 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:42,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1059723442, now seen corresponding path program 1 times [2018-12-02 14:27:42,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:42,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:42,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:27:42,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:42,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:27:42,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:42,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:27:42,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:27:42,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:27:42,150 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-02 14:27:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:42,309 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-02 14:27:42,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:27:42,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-02 14:27:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:42,329 INFO L225 Difference]: With dead ends: 17193 [2018-12-02 14:27:42,329 INFO L226 Difference]: Without dead ends: 17193 [2018-12-02 14:27:42,329 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-02 14:27:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-02 14:27:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-02 14:27:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-02 14:27:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-02 14:27:42,500 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-02 14:27:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:42,500 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-02 14:27:42,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:27:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-02 14:27:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:27:42,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:42,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:42,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:42,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash 380916983, now seen corresponding path program 1 times [2018-12-02 14:27:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:42,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:42,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:27:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:27:42,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:42,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:27:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:27:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:27:42,571 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-02 14:27:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:43,212 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-02 14:27:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:43,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 14:27:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:43,232 INFO L225 Difference]: With dead ends: 20789 [2018-12-02 14:27:43,232 INFO L226 Difference]: Without dead ends: 20789 [2018-12-02 14:27:43,232 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-02 14:27:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-02 14:27:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-02 14:27:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-02 14:27:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-02 14:27:43,430 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-02 14:27:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-02 14:27:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:27:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-02 14:27:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:27:43,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:43,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:43,438 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:43,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1342531000, now seen corresponding path program 1 times [2018-12-02 14:27:43,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:43,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:43,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:43,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:43,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:43,501 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-02 14:27:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:27:43,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:43,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:27:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:27:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:27:43,501 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-02 14:27:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:43,777 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-02 14:27:43,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:27:43,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 14:27:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:43,800 INFO L225 Difference]: With dead ends: 22441 [2018-12-02 14:27:43,800 INFO L226 Difference]: Without dead ends: 22441 [2018-12-02 14:27:43,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:27:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-02 14:27:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-02 14:27:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-02 14:27:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-02 14:27:44,012 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-02 14:27:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:44,012 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-02 14:27:44,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:27:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-02 14:27:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:27:44,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:44,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:44,019 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:44,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1707671815, now seen corresponding path program 1 times [2018-12-02 14:27:44,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:44,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:44,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:44,089 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-02 14:27:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:44,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:44,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:44,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:44,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:44,090 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-02 14:27:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:44,307 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-02 14:27:44,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:44,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 14:27:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:44,338 INFO L225 Difference]: With dead ends: 26432 [2018-12-02 14:27:44,339 INFO L226 Difference]: Without dead ends: 26432 [2018-12-02 14:27:44,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-02 14:27:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-02 14:27:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-02 14:27:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-02 14:27:44,622 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-02 14:27:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-02 14:27:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-02 14:27:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:27:44,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:44,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:44,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:44,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2076761304, now seen corresponding path program 1 times [2018-12-02 14:27:44,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:44,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:44,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:44,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:44,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:44,730 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-02 14:27:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:44,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:44,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:44,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:44,731 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-02 14:27:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:45,051 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-02 14:27:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:27:45,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 14:27:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:45,090 INFO L225 Difference]: With dead ends: 33063 [2018-12-02 14:27:45,090 INFO L226 Difference]: Without dead ends: 33063 [2018-12-02 14:27:45,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:27:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-02 14:27:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-02 14:27:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-02 14:27:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-02 14:27:45,430 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-02 14:27:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:45,430 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-02 14:27:45,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-02 14:27:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:27:45,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:45,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:45,439 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:45,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash 269306841, now seen corresponding path program 1 times [2018-12-02 14:27:45,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:27:45,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:45,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:45,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:45,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:45,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:45,474 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 5 states. [2018-12-02 14:27:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:45,504 INFO L93 Difference]: Finished difference Result 9075 states and 21914 transitions. [2018-12-02 14:27:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:27:45,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 14:27:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:45,509 INFO L225 Difference]: With dead ends: 9075 [2018-12-02 14:27:45,509 INFO L226 Difference]: Without dead ends: 7223 [2018-12-02 14:27:45,509 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-02 14:27:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7223 states. [2018-12-02 14:27:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7223 to 6120. [2018-12-02 14:27:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2018-12-02 14:27:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 14385 transitions. [2018-12-02 14:27:45,556 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 14385 transitions. Word has length 66 [2018-12-02 14:27:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:45,556 INFO L480 AbstractCegarLoop]: Abstraction has 6120 states and 14385 transitions. [2018-12-02 14:27:45,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 14385 transitions. [2018-12-02 14:27:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 14:27:45,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:45,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:45,560 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:45,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2018-12-02 14:27:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:45,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:45,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:45,574 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-02 14:27:45,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:45,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:27:45,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:45,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:27:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:27:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:27:45,575 INFO L87 Difference]: Start difference. First operand 6120 states and 14385 transitions. Second operand 3 states. [2018-12-02 14:27:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:45,603 INFO L93 Difference]: Finished difference Result 8339 states and 19492 transitions. [2018-12-02 14:27:45,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:27:45,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 14:27:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:45,608 INFO L225 Difference]: With dead ends: 8339 [2018-12-02 14:27:45,609 INFO L226 Difference]: Without dead ends: 8339 [2018-12-02 14:27:45,609 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-02 14:27:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8339 states. [2018-12-02 14:27:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8339 to 6059. [2018-12-02 14:27:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6059 states. [2018-12-02 14:27:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 13925 transitions. [2018-12-02 14:27:45,661 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 13925 transitions. Word has length 66 [2018-12-02 14:27:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:45,661 INFO L480 AbstractCegarLoop]: Abstraction has 6059 states and 13925 transitions. [2018-12-02 14:27:45,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:27:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 13925 transitions. [2018-12-02 14:27:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 14:27:45,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:45,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:45,666 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:45,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:45,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2018-12-02 14:27:45,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:45,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:45,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:45,709 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-02 14:27:45,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:45,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:45,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:45,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:45,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:45,710 INFO L87 Difference]: Start difference. First operand 6059 states and 13925 transitions. Second operand 5 states. [2018-12-02 14:27:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:45,799 INFO L93 Difference]: Finished difference Result 7229 states and 16566 transitions. [2018-12-02 14:27:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:27:45,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 14:27:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:45,804 INFO L225 Difference]: With dead ends: 7229 [2018-12-02 14:27:45,805 INFO L226 Difference]: Without dead ends: 7229 [2018-12-02 14:27:45,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:27:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2018-12-02 14:27:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6503. [2018-12-02 14:27:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2018-12-02 14:27:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 14929 transitions. [2018-12-02 14:27:45,851 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 14929 transitions. Word has length 72 [2018-12-02 14:27:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:45,851 INFO L480 AbstractCegarLoop]: Abstraction has 6503 states and 14929 transitions. [2018-12-02 14:27:45,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 14929 transitions. [2018-12-02 14:27:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 14:27:45,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:45,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:45,855 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:45,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2018-12-02 14:27:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:45,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:45,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:27:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:27:45,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:27:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:27:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:27:45,957 INFO L87 Difference]: Start difference. First operand 6503 states and 14929 transitions. Second operand 9 states. [2018-12-02 14:27:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:46,244 INFO L93 Difference]: Finished difference Result 8529 states and 19410 transitions. [2018-12-02 14:27:46,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:27:46,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-02 14:27:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:46,250 INFO L225 Difference]: With dead ends: 8529 [2018-12-02 14:27:46,250 INFO L226 Difference]: Without dead ends: 8410 [2018-12-02 14:27:46,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:27:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-12-02 14:27:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 6600. [2018-12-02 14:27:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6600 states. [2018-12-02 14:27:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 15022 transitions. [2018-12-02 14:27:46,302 INFO L78 Accepts]: Start accepts. Automaton has 6600 states and 15022 transitions. Word has length 72 [2018-12-02 14:27:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:46,302 INFO L480 AbstractCegarLoop]: Abstraction has 6600 states and 15022 transitions. [2018-12-02 14:27:46,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:27:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 15022 transitions. [2018-12-02 14:27:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:27:46,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:46,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:46,307 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:46,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1119414586, now seen corresponding path program 1 times [2018-12-02 14:27:46,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:46,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:46,343 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-02 14:27:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:46,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:46,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:46,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:46,344 INFO L87 Difference]: Start difference. First operand 6600 states and 15022 transitions. Second operand 4 states. [2018-12-02 14:27:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:46,500 INFO L93 Difference]: Finished difference Result 10287 states and 23293 transitions. [2018-12-02 14:27:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:27:46,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 14:27:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:46,507 INFO L225 Difference]: With dead ends: 10287 [2018-12-02 14:27:46,507 INFO L226 Difference]: Without dead ends: 10287 [2018-12-02 14:27:46,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2018-12-02 14:27:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 7720. [2018-12-02 14:27:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7720 states. [2018-12-02 14:27:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 17356 transitions. [2018-12-02 14:27:46,570 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 17356 transitions. Word has length 91 [2018-12-02 14:27:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:46,570 INFO L480 AbstractCegarLoop]: Abstraction has 7720 states and 17356 transitions. [2018-12-02 14:27:46,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 17356 transitions. [2018-12-02 14:27:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:27:46,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:46,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:46,575 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:46,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1265743780, now seen corresponding path program 1 times [2018-12-02 14:27:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:46,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:46,607 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-02 14:27:46,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:46,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:27:46,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:46,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:27:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:27:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:27:46,608 INFO L87 Difference]: Start difference. First operand 7720 states and 17356 transitions. Second operand 4 states. [2018-12-02 14:27:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:46,697 INFO L93 Difference]: Finished difference Result 8285 states and 18649 transitions. [2018-12-02 14:27:46,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:27:46,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 14:27:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:46,702 INFO L225 Difference]: With dead ends: 8285 [2018-12-02 14:27:46,702 INFO L226 Difference]: Without dead ends: 8285 [2018-12-02 14:27:46,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2018-12-02 14:27:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 7626. [2018-12-02 14:27:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2018-12-02 14:27:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 17251 transitions. [2018-12-02 14:27:46,756 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 17251 transitions. Word has length 91 [2018-12-02 14:27:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:46,756 INFO L480 AbstractCegarLoop]: Abstraction has 7626 states and 17251 transitions. [2018-12-02 14:27:46,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:27:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 17251 transitions. [2018-12-02 14:27:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:46,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:46,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:46,761 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:46,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash -248736448, now seen corresponding path program 1 times [2018-12-02 14:27:46,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:46,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:46,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:46,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:46,826 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-02 14:27:46,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:46,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:27:46,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:46,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:27:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:27:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:46,827 INFO L87 Difference]: Start difference. First operand 7626 states and 17251 transitions. Second operand 7 states. [2018-12-02 14:27:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:47,249 INFO L93 Difference]: Finished difference Result 9400 states and 21199 transitions. [2018-12-02 14:27:47,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:47,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 14:27:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:47,255 INFO L225 Difference]: With dead ends: 9400 [2018-12-02 14:27:47,255 INFO L226 Difference]: Without dead ends: 9400 [2018-12-02 14:27:47,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2018-12-02 14:27:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 7738. [2018-12-02 14:27:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7738 states. [2018-12-02 14:27:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 17571 transitions. [2018-12-02 14:27:47,319 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 17571 transitions. Word has length 93 [2018-12-02 14:27:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:47,319 INFO L480 AbstractCegarLoop]: Abstraction has 7738 states and 17571 transitions. [2018-12-02 14:27:47,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:27:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 17571 transitions. [2018-12-02 14:27:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:47,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:47,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:47,324 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:47,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash 190059557, now seen corresponding path program 1 times [2018-12-02 14:27:47,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:47,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:47,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:47,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:47,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:47,353 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-02 14:27:47,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:47,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:47,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:47,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:47,353 INFO L87 Difference]: Start difference. First operand 7738 states and 17571 transitions. Second operand 5 states. [2018-12-02 14:27:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:47,447 INFO L93 Difference]: Finished difference Result 8645 states and 19529 transitions. [2018-12-02 14:27:47,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:47,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 14:27:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:47,452 INFO L225 Difference]: With dead ends: 8645 [2018-12-02 14:27:47,452 INFO L226 Difference]: Without dead ends: 8645 [2018-12-02 14:27:47,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2018-12-02 14:27:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 6634. [2018-12-02 14:27:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6634 states. [2018-12-02 14:27:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 15090 transitions. [2018-12-02 14:27:47,504 INFO L78 Accepts]: Start accepts. Automaton has 6634 states and 15090 transitions. Word has length 93 [2018-12-02 14:27:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:47,504 INFO L480 AbstractCegarLoop]: Abstraction has 6634 states and 15090 transitions. [2018-12-02 14:27:47,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6634 states and 15090 transitions. [2018-12-02 14:27:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:47,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:47,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:47,509 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:47,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash -64676988, now seen corresponding path program 1 times [2018-12-02 14:27:47,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:47,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:47,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:47,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:47,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:47,543 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-02 14:27:47,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:47,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:27:47,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:47,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:27:47,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:27:47,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:27:47,544 INFO L87 Difference]: Start difference. First operand 6634 states and 15090 transitions. Second operand 5 states. [2018-12-02 14:27:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:47,738 INFO L93 Difference]: Finished difference Result 7882 states and 17730 transitions. [2018-12-02 14:27:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:27:47,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 14:27:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:47,743 INFO L225 Difference]: With dead ends: 7882 [2018-12-02 14:27:47,743 INFO L226 Difference]: Without dead ends: 7751 [2018-12-02 14:27:47,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7751 states. [2018-12-02 14:27:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7751 to 7373. [2018-12-02 14:27:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7373 states. [2018-12-02 14:27:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 16709 transitions. [2018-12-02 14:27:47,797 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 16709 transitions. Word has length 93 [2018-12-02 14:27:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:47,798 INFO L480 AbstractCegarLoop]: Abstraction has 7373 states and 16709 transitions. [2018-12-02 14:27:47,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:27:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 16709 transitions. [2018-12-02 14:27:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:47,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:47,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:47,804 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:47,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1180087493, now seen corresponding path program 1 times [2018-12-02 14:27:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:47,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:47,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:47,849 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-02 14:27:47,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:47,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:27:47,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:47,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:27:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:27:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:27:47,850 INFO L87 Difference]: Start difference. First operand 7373 states and 16709 transitions. Second operand 6 states. [2018-12-02 14:27:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:48,038 INFO L93 Difference]: Finished difference Result 9406 states and 21103 transitions. [2018-12-02 14:27:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:27:48,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 14:27:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:48,044 INFO L225 Difference]: With dead ends: 9406 [2018-12-02 14:27:48,044 INFO L226 Difference]: Without dead ends: 9298 [2018-12-02 14:27:48,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:27:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states. [2018-12-02 14:27:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 7200. [2018-12-02 14:27:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7200 states. [2018-12-02 14:27:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 16315 transitions. [2018-12-02 14:27:48,104 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 16315 transitions. Word has length 93 [2018-12-02 14:27:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:48,104 INFO L480 AbstractCegarLoop]: Abstraction has 7200 states and 16315 transitions. [2018-12-02 14:27:48,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:27:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 16315 transitions. [2018-12-02 14:27:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:48,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:48,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:48,110 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:48,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash 86477922, now seen corresponding path program 1 times [2018-12-02 14:27:48,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:48,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:48,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:48,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:48,188 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-02 14:27:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:48,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:27:48,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:48,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:27:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:27:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:27:48,189 INFO L87 Difference]: Start difference. First operand 7200 states and 16315 transitions. Second operand 9 states. [2018-12-02 14:27:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:48,508 INFO L93 Difference]: Finished difference Result 10191 states and 23070 transitions. [2018-12-02 14:27:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 14:27:48,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-02 14:27:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:48,515 INFO L225 Difference]: With dead ends: 10191 [2018-12-02 14:27:48,515 INFO L226 Difference]: Without dead ends: 10159 [2018-12-02 14:27:48,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:27:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10159 states. [2018-12-02 14:27:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10159 to 9008. [2018-12-02 14:27:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2018-12-02 14:27:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 20407 transitions. [2018-12-02 14:27:48,582 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 20407 transitions. Word has length 93 [2018-12-02 14:27:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:48,583 INFO L480 AbstractCegarLoop]: Abstraction has 9008 states and 20407 transitions. [2018-12-02 14:27:48,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:27:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 20407 transitions. [2018-12-02 14:27:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:48,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:48,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:48,589 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:48,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1710473437, now seen corresponding path program 1 times [2018-12-02 14:27:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:48,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:48,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-02 14:27:48,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 14:27:48,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:48,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:27:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:27:48,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:27:48,679 INFO L87 Difference]: Start difference. First operand 9008 states and 20407 transitions. Second operand 8 states. [2018-12-02 14:27:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:48,973 INFO L93 Difference]: Finished difference Result 14357 states and 33169 transitions. [2018-12-02 14:27:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:27:48,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 14:27:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:48,982 INFO L225 Difference]: With dead ends: 14357 [2018-12-02 14:27:48,982 INFO L226 Difference]: Without dead ends: 14357 [2018-12-02 14:27:48,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:27:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14357 states. [2018-12-02 14:27:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14357 to 9634. [2018-12-02 14:27:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2018-12-02 14:27:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 22044 transitions. [2018-12-02 14:27:49,103 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 22044 transitions. Word has length 93 [2018-12-02 14:27:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:49,104 INFO L480 AbstractCegarLoop]: Abstraction has 9634 states and 22044 transitions. [2018-12-02 14:27:49,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:27:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 22044 transitions. [2018-12-02 14:27:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:49,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:49,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:49,113 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:49,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash -822969756, now seen corresponding path program 1 times [2018-12-02 14:27:49,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:49,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:49,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:49,198 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-02 14:27:49,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:49,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:27:49,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:49,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:27:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:27:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:49,199 INFO L87 Difference]: Start difference. First operand 9634 states and 22044 transitions. Second operand 7 states. [2018-12-02 14:27:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:49,298 INFO L93 Difference]: Finished difference Result 13692 states and 31671 transitions. [2018-12-02 14:27:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:49,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 14:27:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:49,308 INFO L225 Difference]: With dead ends: 13692 [2018-12-02 14:27:49,308 INFO L226 Difference]: Without dead ends: 13692 [2018-12-02 14:27:49,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:27:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2018-12-02 14:27:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 9705. [2018-12-02 14:27:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9705 states. [2018-12-02 14:27:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9705 states to 9705 states and 22008 transitions. [2018-12-02 14:27:49,397 INFO L78 Accepts]: Start accepts. Automaton has 9705 states and 22008 transitions. Word has length 93 [2018-12-02 14:27:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:49,398 INFO L480 AbstractCegarLoop]: Abstraction has 9705 states and 22008 transitions. [2018-12-02 14:27:49,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:27:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9705 states and 22008 transitions. [2018-12-02 14:27:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:27:49,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:49,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:27:49,404 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:49,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1740021988, now seen corresponding path program 1 times [2018-12-02 14:27:49,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:49,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:49,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:49,461 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-02 14:27:49,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:49,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:27:49,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:49,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:27:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:27:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:27:49,461 INFO L87 Difference]: Start difference. First operand 9705 states and 22008 transitions. Second operand 6 states. [2018-12-02 14:27:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:49,529 INFO L93 Difference]: Finished difference Result 9433 states and 21056 transitions. [2018-12-02 14:27:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:27:49,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 14:27:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:49,535 INFO L225 Difference]: With dead ends: 9433 [2018-12-02 14:27:49,535 INFO L226 Difference]: Without dead ends: 9433 [2018-12-02 14:27:49,535 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-02 14:27:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2018-12-02 14:27:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 5737. [2018-12-02 14:27:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2018-12-02 14:27:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 12775 transitions. [2018-12-02 14:27:49,590 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 12775 transitions. Word has length 93 [2018-12-02 14:27:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:49,590 INFO L480 AbstractCegarLoop]: Abstraction has 5737 states and 12775 transitions. [2018-12-02 14:27:49,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:27:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 12775 transitions. [2018-12-02 14:27:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:27:49,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:49,594 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] [2018-12-02 14:27:49,594 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:49,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 672697743, now seen corresponding path program 1 times [2018-12-02 14:27:49,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:49,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:49,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:49,686 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-02 14:27:49,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:49,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:27:49,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:49,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:27:49,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:27:49,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:27:49,687 INFO L87 Difference]: Start difference. First operand 5737 states and 12775 transitions. Second operand 9 states. [2018-12-02 14:27:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:49,948 INFO L93 Difference]: Finished difference Result 6956 states and 15367 transitions. [2018-12-02 14:27:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 14:27:49,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 14:27:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:49,952 INFO L225 Difference]: With dead ends: 6956 [2018-12-02 14:27:49,952 INFO L226 Difference]: Without dead ends: 6956 [2018-12-02 14:27:49,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 14:27:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6956 states. [2018-12-02 14:27:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6956 to 6700. [2018-12-02 14:27:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6700 states. [2018-12-02 14:27:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 14863 transitions. [2018-12-02 14:27:49,999 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 14863 transitions. Word has length 95 [2018-12-02 14:27:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:50,000 INFO L480 AbstractCegarLoop]: Abstraction has 6700 states and 14863 transitions. [2018-12-02 14:27:50,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:27:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 14863 transitions. [2018-12-02 14:27:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:27:50,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:50,004 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] [2018-12-02 14:27:50,004 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:50,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1560201424, now seen corresponding path program 1 times [2018-12-02 14:27:50,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:50,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:50,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:50,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:50,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:50,097 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-02 14:27:50,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:50,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 14:27:50,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:50,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:27:50,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:27:50,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:27:50,098 INFO L87 Difference]: Start difference. First operand 6700 states and 14863 transitions. Second operand 11 states. [2018-12-02 14:27:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:50,881 INFO L93 Difference]: Finished difference Result 12829 states and 28595 transitions. [2018-12-02 14:27:50,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:27:50,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 14:27:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:50,887 INFO L225 Difference]: With dead ends: 12829 [2018-12-02 14:27:50,887 INFO L226 Difference]: Without dead ends: 8744 [2018-12-02 14:27:50,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:27:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2018-12-02 14:27:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 6541. [2018-12-02 14:27:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6541 states. [2018-12-02 14:27:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 14470 transitions. [2018-12-02 14:27:50,939 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 14470 transitions. Word has length 95 [2018-12-02 14:27:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:50,939 INFO L480 AbstractCegarLoop]: Abstraction has 6541 states and 14470 transitions. [2018-12-02 14:27:50,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:27:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 14470 transitions. [2018-12-02 14:27:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:27:50,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:50,944 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] [2018-12-02 14:27:50,944 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:50,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash -961178655, now seen corresponding path program 1 times [2018-12-02 14:27:50,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:50,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:50,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:50,998 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-02 14:27:50,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:50,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:27:50,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:50,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:27:50,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:27:50,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:27:50,999 INFO L87 Difference]: Start difference. First operand 6541 states and 14470 transitions. Second operand 7 states. [2018-12-02 14:27:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:51,258 INFO L93 Difference]: Finished difference Result 8091 states and 17682 transitions. [2018-12-02 14:27:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:27:51,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 14:27:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:51,262 INFO L225 Difference]: With dead ends: 8091 [2018-12-02 14:27:51,263 INFO L226 Difference]: Without dead ends: 8071 [2018-12-02 14:27:51,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:27:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2018-12-02 14:27:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 6907. [2018-12-02 14:27:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6907 states. [2018-12-02 14:27:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 15166 transitions. [2018-12-02 14:27:51,313 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 15166 transitions. Word has length 95 [2018-12-02 14:27:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:51,313 INFO L480 AbstractCegarLoop]: Abstraction has 6907 states and 15166 transitions. [2018-12-02 14:27:51,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:27:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 15166 transitions. [2018-12-02 14:27:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:27:51,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:51,318 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] [2018-12-02 14:27:51,318 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:51,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash -143041951, now seen corresponding path program 2 times [2018-12-02 14:27:51,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:51,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:27:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:51,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:27:51,361 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-02 14:27:51,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:27:51,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:27:51,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:27:51,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:27:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:27:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:27:51,362 INFO L87 Difference]: Start difference. First operand 6907 states and 15166 transitions. Second operand 6 states. [2018-12-02 14:27:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:27:51,472 INFO L93 Difference]: Finished difference Result 7120 states and 15597 transitions. [2018-12-02 14:27:51,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:27:51,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 14:27:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:27:51,476 INFO L225 Difference]: With dead ends: 7120 [2018-12-02 14:27:51,477 INFO L226 Difference]: Without dead ends: 7120 [2018-12-02 14:27:51,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:27:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7120 states. [2018-12-02 14:27:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7120 to 6672. [2018-12-02 14:27:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6672 states. [2018-12-02 14:27:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6672 states to 6672 states and 14654 transitions. [2018-12-02 14:27:51,522 INFO L78 Accepts]: Start accepts. Automaton has 6672 states and 14654 transitions. Word has length 95 [2018-12-02 14:27:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:27:51,522 INFO L480 AbstractCegarLoop]: Abstraction has 6672 states and 14654 transitions. [2018-12-02 14:27:51,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:27:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6672 states and 14654 transitions. [2018-12-02 14:27:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:27:51,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:27:51,526 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] [2018-12-02 14:27:51,527 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:27:51,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:27:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash -631412894, now seen corresponding path program 2 times [2018-12-02 14:27:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:27:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:51,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:27:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:27:51,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:27:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:27:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:27:51,563 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:27:51,629 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 14:27:51,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:27:51 BasicIcfg [2018-12-02 14:27:51,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:27:51,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:27:51,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:27:51,630 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:27:51,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:27:35" (3/4) ... [2018-12-02 14:27:51,632 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:27:51,700 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_477e5790-9054-4605-a25a-fb7a52b110d5/bin-2019/utaipan/witness.graphml [2018-12-02 14:27:51,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:27:51,701 INFO L168 Benchmark]: Toolchain (without parser) took 16884.27 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 947.0 MB in the beginning and 841.4 MB in the end (delta: 105.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 14:27:51,702 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:27:51,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:27:51,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.98 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-02 14:27:51,703 INFO L168 Benchmark]: Boogie Preprocessor took 19.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:27:51,703 INFO L168 Benchmark]: RCFGBuilder took 320.31 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:27:51,703 INFO L168 Benchmark]: TraceAbstraction took 16087.76 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 866.9 MB in the end (delta: 173.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 14:27:51,703 INFO L168 Benchmark]: Witness Printer took 70.24 ms. Allocated memory is still 2.3 GB. Free memory was 866.9 MB in the beginning and 841.4 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:27:51,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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.98 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 19.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 320.31 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16087.76 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 866.9 MB in the end (delta: 173.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 70.24 ms. Allocated memory is still 2.3 GB. Free memory was 866.9 MB in the beginning and 841.4 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t1717; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1718; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.0s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8380 SDtfs, 9578 SDslu, 20123 SDs, 0 SdLazy, 8952 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 83 SyntacticMatches, 31 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 88237 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2477 NumberOfCodeBlocks, 2477 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2350 ConstructedInterpolants, 0 QuantifiedInterpolants, 519263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...