./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_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_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/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 b3e25a2480bcae64d4b9bc42e36cbe5af359915e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 02:41:58,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:41:58,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:41:58,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:41:58,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:41:58,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:41:58,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:41:58,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:41:58,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:41:58,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:41:58,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:41:58,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:41:58,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:41:58,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:41:58,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:41:58,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:41:58,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:41:58,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:41:58,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:41:58,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:41:58,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:41:58,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:41:58,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:41:58,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:41:58,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:41:58,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:41:58,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:41:58,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:41:58,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:41:58,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:41:58,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:41:58,464 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:41:58,464 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:41:58,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:41:58,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:41:58,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:41:58,465 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 02:41:58,472 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:41:58,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:41:58,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:41:58,473 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:41:58,473 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 02:41:58,473 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 02:41:58,473 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 02:41:58,473 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 02:41:58,474 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 02:41:58,474 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 02:41:58,474 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 02:41:58,474 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 02:41:58,474 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 02:41:58,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:41:58,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:41:58,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:41:58,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:41:58,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:41:58,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:41:58,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:41:58,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:41:58,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:41:58,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:41:58,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:41:58,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:41:58,477 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 02:41:58,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:41:58,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:41:58,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 02:41:58,477 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_4225544e-ab10-44a7-b923-d8cd0eaa01a6/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 -> b3e25a2480bcae64d4b9bc42e36cbe5af359915e [2018-12-09 02:41:58,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:41:58,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:41:58,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:41:58,503 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:41:58,503 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:41:58,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt_false-unreach-call.i [2018-12-09 02:41:58,538 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/data/0bd2bd25e/0879a9f0ba4e4517a01e35c2e956a661/FLAGed9c86dd4 [2018-12-09 02:41:58,970 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:41:58,970 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt_false-unreach-call.i [2018-12-09 02:41:58,978 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/data/0bd2bd25e/0879a9f0ba4e4517a01e35c2e956a661/FLAGed9c86dd4 [2018-12-09 02:41:58,986 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/data/0bd2bd25e/0879a9f0ba4e4517a01e35c2e956a661 [2018-12-09 02:41:58,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:41:58,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:41:58,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:41:58,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:41:58,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:41:58,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:41:58" (1/1) ... [2018-12-09 02:41:58,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58, skipping insertion in model container [2018-12-09 02:41:58,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:41:58" (1/1) ... [2018-12-09 02:41:58,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:41:59,019 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:41:59,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:41:59,199 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:41:59,273 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:41:59,303 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:41:59,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59 WrapperNode [2018-12-09 02:41:59,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:41:59,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:41:59,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:41:59,304 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:41:59,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:41:59,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:41:59,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:41:59,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:41:59,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... [2018-12-09 02:41:59,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:41:59,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:41:59,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:41:59,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:41:59,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 02:41:59,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 02:41:59,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 02:41:59,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 02:41:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:41:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:41:59,387 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 02:41:59,695 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:41:59,695 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:41:59,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:41:59 BoogieIcfgContainer [2018-12-09 02:41:59,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:41:59,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:41:59,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:41:59,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:41:59,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:41:58" (1/3) ... [2018-12-09 02:41:59,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:41:59, skipping insertion in model container [2018-12-09 02:41:59,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:59" (2/3) ... [2018-12-09 02:41:59,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:41:59, skipping insertion in model container [2018-12-09 02:41:59,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:41:59" (3/3) ... [2018-12-09 02:41:59,699 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.opt_false-unreach-call.i [2018-12-09 02:41:59,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,726 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,741 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:41:59,750 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 02:41:59,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:41:59,757 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 02:41:59,769 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 02:41:59,785 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:41:59,785 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 02:41:59,785 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:41:59,785 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:41:59,785 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:41:59,785 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:41:59,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:41:59,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:41:59,793 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-12-09 02:42:00,895 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-12-09 02:42:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-12-09 02:42:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 02:42:00,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:00,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:00,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-12-09 02:42:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:00,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:00,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:01,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:01,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:01,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:01,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:01,083 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-12-09 02:42:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:01,424 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-12-09 02:42:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:01,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 02:42:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:01,554 INFO L225 Difference]: With dead ends: 47767 [2018-12-09 02:42:01,555 INFO L226 Difference]: Without dead ends: 34607 [2018-12-09 02:42:01,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-12-09 02:42:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-12-09 02:42:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-12-09 02:42:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-12-09 02:42:02,267 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-12-09 02:42:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:02,267 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-12-09 02:42:02,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-12-09 02:42:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 02:42:02,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:02,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:02,274 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:02,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-12-09 02:42:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:02,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:02,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:02,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:02,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:02,346 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-12-09 02:42:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:02,850 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-12-09 02:42:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:02,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 02:42:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:02,978 INFO L225 Difference]: With dead ends: 47633 [2018-12-09 02:42:02,978 INFO L226 Difference]: Without dead ends: 47065 [2018-12-09 02:42:02,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-12-09 02:42:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-12-09 02:42:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-12-09 02:42:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-12-09 02:42:03,681 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-12-09 02:42:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-12-09 02:42:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-12-09 02:42:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 02:42:03,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:03,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:03,685 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:03,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-12-09 02:42:03,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:03,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:03,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:03,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:03,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:03,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:03,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:03,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:03,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:03,745 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-12-09 02:42:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:04,096 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-12-09 02:42:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:04,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 02:42:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:04,208 INFO L225 Difference]: With dead ends: 63027 [2018-12-09 02:42:04,209 INFO L226 Difference]: Without dead ends: 62563 [2018-12-09 02:42:04,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-12-09 02:42:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-12-09 02:42:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-12-09 02:42:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-12-09 02:42:04,953 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-12-09 02:42:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:04,953 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-12-09 02:42:04,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-12-09 02:42:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 02:42:04,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:04,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:04,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:04,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:04,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-12-09 02:42:04,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:04,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:04,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:04,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:04,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:04,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:04,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:04,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:04,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:42:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:04,985 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-12-09 02:42:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:05,125 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-12-09 02:42:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:05,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 02:42:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:05,198 INFO L225 Difference]: With dead ends: 45909 [2018-12-09 02:42:05,198 INFO L226 Difference]: Without dead ends: 45909 [2018-12-09 02:42:05,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-12-09 02:42:05,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-12-09 02:42:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-12-09 02:42:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-12-09 02:42:05,842 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-12-09 02:42:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:05,842 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-12-09 02:42:05,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:42:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-12-09 02:42:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:05,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:05,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:05,851 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:05,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1764675695, now seen corresponding path program 1 times [2018-12-09 02:42:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:05,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:05,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:05,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:05,892 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-12-09 02:42:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:06,356 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-12-09 02:42:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:42:06,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:42:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:06,477 INFO L225 Difference]: With dead ends: 70849 [2018-12-09 02:42:06,477 INFO L226 Difference]: Without dead ends: 70313 [2018-12-09 02:42:06,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 02:42:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-12-09 02:42:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-12-09 02:42:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-12-09 02:42:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-12-09 02:42:07,237 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-12-09 02:42:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:07,238 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-12-09 02:42:07,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-12-09 02:42:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:07,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:07,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:07,245 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:07,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-12-09 02:42:07,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:07,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:07,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:07,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:07,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:07,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:07,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:07,328 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-12-09 02:42:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:07,773 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-12-09 02:42:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:07,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:42:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:07,872 INFO L225 Difference]: With dead ends: 56598 [2018-12-09 02:42:07,872 INFO L226 Difference]: Without dead ends: 55459 [2018-12-09 02:42:07,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-12-09 02:42:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-12-09 02:42:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-12-09 02:42:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-12-09 02:42:08,695 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-12-09 02:42:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:08,695 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-12-09 02:42:08,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-12-09 02:42:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:08,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:08,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:08,704 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:08,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-12-09 02:42:08,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:08,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:08,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:08,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:08,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:08,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:08,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:08,760 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-12-09 02:42:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:09,347 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-12-09 02:42:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:42:09,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 02:42:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:09,475 INFO L225 Difference]: With dead ends: 75637 [2018-12-09 02:42:09,475 INFO L226 Difference]: Without dead ends: 75637 [2018-12-09 02:42:09,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:42:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-12-09 02:42:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-12-09 02:42:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-12-09 02:42:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-12-09 02:42:10,448 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-12-09 02:42:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:10,449 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-12-09 02:42:10,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-12-09 02:42:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:42:10,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:10,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:10,459 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:10,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-12-09 02:42:10,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:10,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:10,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:10,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:10,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:10,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:10,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:10,496 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-12-09 02:42:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:10,549 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-12-09 02:42:10,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:10,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 02:42:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:10,565 INFO L225 Difference]: With dead ends: 13777 [2018-12-09 02:42:10,566 INFO L226 Difference]: Without dead ends: 12160 [2018-12-09 02:42:10,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-12-09 02:42:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-12-09 02:42:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-09 02:42:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-12-09 02:42:10,688 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-12-09 02:42:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:10,688 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-12-09 02:42:10,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-12-09 02:42:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 02:42:10,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:10,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:10,692 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:10,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash 942323206, now seen corresponding path program 1 times [2018-12-09 02:42:10,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:10,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:10,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:10,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:10,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:10,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:10,729 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-12-09 02:42:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:10,837 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-12-09 02:42:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:10,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 02:42:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:10,852 INFO L225 Difference]: With dead ends: 14275 [2018-12-09 02:42:10,853 INFO L226 Difference]: Without dead ends: 14275 [2018-12-09 02:42:10,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-12-09 02:42:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-12-09 02:42:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-12-09 02:42:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-12-09 02:42:10,991 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-12-09 02:42:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:10,991 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-12-09 02:42:10,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-12-09 02:42:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 02:42:10,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:10,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:10,996 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:10,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1609833755, now seen corresponding path program 1 times [2018-12-09 02:42:10,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:10,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:10,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:10,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:10,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:11,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:11,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:11,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:11,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:11,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:11,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:11,040 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-12-09 02:42:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:11,325 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-12-09 02:42:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 02:42:11,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 02:42:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:11,352 INFO L225 Difference]: With dead ends: 23410 [2018-12-09 02:42:11,352 INFO L226 Difference]: Without dead ends: 23346 [2018-12-09 02:42:11,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 02:42:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-12-09 02:42:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-12-09 02:42:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-12-09 02:42:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-12-09 02:42:11,535 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-12-09 02:42:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:11,535 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-12-09 02:42:11,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-12-09 02:42:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:42:11,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:11,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:11,541 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:11,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-12-09 02:42:11,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:11,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:11,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:11,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:11,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:11,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:11,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:11,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:11,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:11,574 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-12-09 02:42:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:11,725 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-12-09 02:42:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:11,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 02:42:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:11,748 INFO L225 Difference]: With dead ends: 17359 [2018-12-09 02:42:11,748 INFO L226 Difference]: Without dead ends: 17359 [2018-12-09 02:42:11,748 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-09 02:42:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-12-09 02:42:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-12-09 02:42:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-12-09 02:42:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-12-09 02:42:11,968 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-12-09 02:42:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:11,969 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-12-09 02:42:11,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-12-09 02:42:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:42:11,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:11,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:11,976 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:11,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:11,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-12-09 02:42:11,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:11,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:11,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:11,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:11,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:11,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:42:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:11,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:11,993 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-12-09 02:42:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:12,099 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-12-09 02:42:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:12,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 02:42:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:12,117 INFO L225 Difference]: With dead ends: 16413 [2018-12-09 02:42:12,117 INFO L226 Difference]: Without dead ends: 16413 [2018-12-09 02:42:12,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-12-09 02:42:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-12-09 02:42:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-09 02:42:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-12-09 02:42:12,274 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-12-09 02:42:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:12,274 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-12-09 02:42:12,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:42:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-12-09 02:42:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:12,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:12,282 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] [2018-12-09 02:42:12,282 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:12,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-12-09 02:42:12,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:12,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:12,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:12,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:12,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:12,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:12,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:12,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:12,335 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-12-09 02:42:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:12,710 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-12-09 02:42:12,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:12,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:42:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:12,732 INFO L225 Difference]: With dead ends: 19568 [2018-12-09 02:42:12,732 INFO L226 Difference]: Without dead ends: 19568 [2018-12-09 02:42:12,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-12-09 02:42:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-12-09 02:42:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-09 02:42:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-12-09 02:42:12,918 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-12-09 02:42:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:12,918 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-12-09 02:42:12,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-12-09 02:42:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:12,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:12,928 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] [2018-12-09 02:42:12,928 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:12,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-12-09 02:42:12,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:12,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:12,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:12,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:12,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:12,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:12,987 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-12-09 02:42:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:13,207 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-12-09 02:42:13,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:13,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:42:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:13,238 INFO L225 Difference]: With dead ends: 21666 [2018-12-09 02:42:13,239 INFO L226 Difference]: Without dead ends: 21666 [2018-12-09 02:42:13,239 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-09 02:42:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-12-09 02:42:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-12-09 02:42:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-09 02:42:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-12-09 02:42:13,431 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-12-09 02:42:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:13,431 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-12-09 02:42:13,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-12-09 02:42:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:13,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:13,440 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] [2018-12-09 02:42:13,440 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:13,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-12-09 02:42:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:13,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:13,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:13,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:13,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:13,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:13,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:13,501 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-12-09 02:42:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:13,690 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-12-09 02:42:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:13,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:42:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:13,718 INFO L225 Difference]: With dead ends: 23854 [2018-12-09 02:42:13,718 INFO L226 Difference]: Without dead ends: 23854 [2018-12-09 02:42:13,718 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-09 02:42:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-12-09 02:42:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-12-09 02:42:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-12-09 02:42:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-12-09 02:42:13,921 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-12-09 02:42:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:13,921 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-12-09 02:42:13,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-12-09 02:42:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:13,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:13,929 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] [2018-12-09 02:42:13,930 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:13,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:13,930 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-12-09 02:42:13,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:13,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:13,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:13,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:13,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:13,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:13,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:13,962 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-12-09 02:42:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:14,217 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-12-09 02:42:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:14,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:42:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:14,249 INFO L225 Difference]: With dead ends: 27231 [2018-12-09 02:42:14,250 INFO L226 Difference]: Without dead ends: 27231 [2018-12-09 02:42:14,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-12-09 02:42:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-12-09 02:42:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-09 02:42:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-12-09 02:42:14,503 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-12-09 02:42:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:14,503 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-12-09 02:42:14,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-12-09 02:42:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:14,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:14,512 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] [2018-12-09 02:42:14,512 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:14,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-12-09 02:42:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:14,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:14,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:14,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:14,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:14,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:42:14,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:14,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:14,541 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-12-09 02:42:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:14,830 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-12-09 02:42:14,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:14,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 02:42:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:14,862 INFO L225 Difference]: With dead ends: 28445 [2018-12-09 02:42:14,862 INFO L226 Difference]: Without dead ends: 28025 [2018-12-09 02:42:14,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-12-09 02:42:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-12-09 02:42:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-12-09 02:42:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-12-09 02:42:15,145 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-12-09 02:42:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:15,145 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-12-09 02:42:15,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:42:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-12-09 02:42:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:42:15,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:15,158 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] [2018-12-09 02:42:15,158 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:15,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:15,158 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-12-09 02:42:15,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:15,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:15,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:15,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:15,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:15,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:15,195 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 5 states. [2018-12-09 02:42:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:15,224 INFO L93 Difference]: Finished difference Result 7049 states and 16989 transitions. [2018-12-09 02:42:15,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:15,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:42:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:15,229 INFO L225 Difference]: With dead ends: 7049 [2018-12-09 02:42:15,229 INFO L226 Difference]: Without dead ends: 5562 [2018-12-09 02:42:15,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-12-09 02:42:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4888. [2018-12-09 02:42:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-09 02:42:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11541 transitions. [2018-12-09 02:42:15,264 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11541 transitions. Word has length 67 [2018-12-09 02:42:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:15,264 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11541 transitions. [2018-12-09 02:42:15,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11541 transitions. [2018-12-09 02:42:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 02:42:15,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:15,267 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] [2018-12-09 02:42:15,267 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:15,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1225324604, now seen corresponding path program 1 times [2018-12-09 02:42:15,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:15,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:15,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:15,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:15,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:42:15,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:15,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:42:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:15,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:15,307 INFO L87 Difference]: Start difference. First operand 4888 states and 11541 transitions. Second operand 5 states. [2018-12-09 02:42:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:15,431 INFO L93 Difference]: Finished difference Result 5732 states and 13375 transitions. [2018-12-09 02:42:15,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:15,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 02:42:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:15,435 INFO L225 Difference]: With dead ends: 5732 [2018-12-09 02:42:15,435 INFO L226 Difference]: Without dead ends: 5698 [2018-12-09 02:42:15,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2018-12-09 02:42:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5046. [2018-12-09 02:42:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-12-09 02:42:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 11853 transitions. [2018-12-09 02:42:15,470 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 11853 transitions. Word has length 82 [2018-12-09 02:42:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:15,470 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 11853 transitions. [2018-12-09 02:42:15,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:42:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 11853 transitions. [2018-12-09 02:42:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 02:42:15,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:15,473 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] [2018-12-09 02:42:15,474 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:15,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:15,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1401587043, now seen corresponding path program 1 times [2018-12-09 02:42:15,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:15,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:15,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:15,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:15,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:15,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:15,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:15,528 INFO L87 Difference]: Start difference. First operand 5046 states and 11853 transitions. Second operand 6 states. [2018-12-09 02:42:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:15,701 INFO L93 Difference]: Finished difference Result 6708 states and 15748 transitions. [2018-12-09 02:42:15,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:15,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 02:42:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:15,705 INFO L225 Difference]: With dead ends: 6708 [2018-12-09 02:42:15,706 INFO L226 Difference]: Without dead ends: 6676 [2018-12-09 02:42:15,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2018-12-09 02:42:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 5404. [2018-12-09 02:42:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5404 states. [2018-12-09 02:42:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 12732 transitions. [2018-12-09 02:42:15,748 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 12732 transitions. Word has length 82 [2018-12-09 02:42:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:15,748 INFO L480 AbstractCegarLoop]: Abstraction has 5404 states and 12732 transitions. [2018-12-09 02:42:15,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 12732 transitions. [2018-12-09 02:42:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 02:42:15,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:15,752 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] [2018-12-09 02:42:15,752 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:15,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash -395364316, now seen corresponding path program 1 times [2018-12-09 02:42:15,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:15,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:15,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:15,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:15,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:15,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:15,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:15,804 INFO L87 Difference]: Start difference. First operand 5404 states and 12732 transitions. Second operand 7 states. [2018-12-09 02:42:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:16,039 INFO L93 Difference]: Finished difference Result 8734 states and 21012 transitions. [2018-12-09 02:42:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:42:16,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 02:42:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:16,046 INFO L225 Difference]: With dead ends: 8734 [2018-12-09 02:42:16,046 INFO L226 Difference]: Without dead ends: 8734 [2018-12-09 02:42:16,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:42:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2018-12-09 02:42:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 6145. [2018-12-09 02:42:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-09 02:42:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 14616 transitions. [2018-12-09 02:42:16,107 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 14616 transitions. Word has length 82 [2018-12-09 02:42:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:16,107 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 14616 transitions. [2018-12-09 02:42:16,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 14616 transitions. [2018-12-09 02:42:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 02:42:16,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:16,111 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] [2018-12-09 02:42:16,111 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:16,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:16,111 INFO L82 PathProgramCache]: Analyzing trace with hash 492139365, now seen corresponding path program 1 times [2018-12-09 02:42:16,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:16,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:16,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:16,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:16,180 INFO L87 Difference]: Start difference. First operand 6145 states and 14616 transitions. Second operand 6 states. [2018-12-09 02:42:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:16,211 INFO L93 Difference]: Finished difference Result 7313 states and 17387 transitions. [2018-12-09 02:42:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:16,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 02:42:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:16,216 INFO L225 Difference]: With dead ends: 7313 [2018-12-09 02:42:16,216 INFO L226 Difference]: Without dead ends: 7313 [2018-12-09 02:42:16,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-12-09 02:42:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 5480. [2018-12-09 02:42:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2018-12-09 02:42:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 12892 transitions. [2018-12-09 02:42:16,258 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 12892 transitions. Word has length 82 [2018-12-09 02:42:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:16,258 INFO L480 AbstractCegarLoop]: Abstraction has 5480 states and 12892 transitions. [2018-12-09 02:42:16,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 12892 transitions. [2018-12-09 02:42:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 02:42:16,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:16,261 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] [2018-12-09 02:42:16,262 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:16,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1239836187, now seen corresponding path program 1 times [2018-12-09 02:42:16,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:16,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:16,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:42:16,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:16,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:42:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:16,309 INFO L87 Difference]: Start difference. First operand 5480 states and 12892 transitions. Second operand 6 states. [2018-12-09 02:42:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:16,381 INFO L93 Difference]: Finished difference Result 5096 states and 11724 transitions. [2018-12-09 02:42:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:16,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 02:42:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:16,385 INFO L225 Difference]: With dead ends: 5096 [2018-12-09 02:42:16,385 INFO L226 Difference]: Without dead ends: 5096 [2018-12-09 02:42:16,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2018-12-09 02:42:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 3190. [2018-12-09 02:42:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2018-12-09 02:42:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 7391 transitions. [2018-12-09 02:42:16,412 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 7391 transitions. Word has length 82 [2018-12-09 02:42:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:16,412 INFO L480 AbstractCegarLoop]: Abstraction has 3190 states and 7391 transitions. [2018-12-09 02:42:16,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:42:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 7391 transitions. [2018-12-09 02:42:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:16,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:16,414 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] [2018-12-09 02:42:16,414 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:16,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1939261575, now seen corresponding path program 1 times [2018-12-09 02:42:16,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:16,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:16,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:16,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:16,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:16,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:16,487 INFO L87 Difference]: Start difference. First operand 3190 states and 7391 transitions. Second operand 7 states. [2018-12-09 02:42:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:16,629 INFO L93 Difference]: Finished difference Result 3738 states and 8627 transitions. [2018-12-09 02:42:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:16,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-09 02:42:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:16,632 INFO L225 Difference]: With dead ends: 3738 [2018-12-09 02:42:16,632 INFO L226 Difference]: Without dead ends: 3738 [2018-12-09 02:42:16,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:42:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2018-12-09 02:42:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3641. [2018-12-09 02:42:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2018-12-09 02:42:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 8435 transitions. [2018-12-09 02:42:16,663 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 8435 transitions. Word has length 84 [2018-12-09 02:42:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:16,663 INFO L480 AbstractCegarLoop]: Abstraction has 3641 states and 8435 transitions. [2018-12-09 02:42:16,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 8435 transitions. [2018-12-09 02:42:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:16,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:16,666 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] [2018-12-09 02:42:16,666 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:16,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1051757894, now seen corresponding path program 1 times [2018-12-09 02:42:16,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:16,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:16,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:16,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:16,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 02:42:16,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:16,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 02:42:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 02:42:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:42:16,749 INFO L87 Difference]: Start difference. First operand 3641 states and 8435 transitions. Second operand 10 states. [2018-12-09 02:42:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:17,461 INFO L93 Difference]: Finished difference Result 6341 states and 14692 transitions. [2018-12-09 02:42:17,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:42:17,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-12-09 02:42:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:17,465 INFO L225 Difference]: With dead ends: 6341 [2018-12-09 02:42:17,465 INFO L226 Difference]: Without dead ends: 4297 [2018-12-09 02:42:17,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-09 02:42:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2018-12-09 02:42:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 3676. [2018-12-09 02:42:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3676 states. [2018-12-09 02:42:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 8434 transitions. [2018-12-09 02:42:17,506 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 8434 transitions. Word has length 84 [2018-12-09 02:42:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:17,506 INFO L480 AbstractCegarLoop]: Abstraction has 3676 states and 8434 transitions. [2018-12-09 02:42:17,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 02:42:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 8434 transitions. [2018-12-09 02:42:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:17,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:17,510 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] [2018-12-09 02:42:17,510 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:17,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 454383476, now seen corresponding path program 2 times [2018-12-09 02:42:17,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:17,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:17,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:17,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:42:17,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:17,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:42:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:42:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:17,584 INFO L87 Difference]: Start difference. First operand 3676 states and 8434 transitions. Second operand 8 states. [2018-12-09 02:42:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:17,930 INFO L93 Difference]: Finished difference Result 6529 states and 15057 transitions. [2018-12-09 02:42:17,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:17,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-09 02:42:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:17,933 INFO L225 Difference]: With dead ends: 6529 [2018-12-09 02:42:17,934 INFO L226 Difference]: Without dead ends: 2810 [2018-12-09 02:42:17,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:42:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2018-12-09 02:42:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2810. [2018-12-09 02:42:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2018-12-09 02:42:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6504 transitions. [2018-12-09 02:42:17,966 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6504 transitions. Word has length 84 [2018-12-09 02:42:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:17,966 INFO L480 AbstractCegarLoop]: Abstraction has 2810 states and 6504 transitions. [2018-12-09 02:42:17,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:42:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6504 transitions. [2018-12-09 02:42:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:17,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:17,970 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] [2018-12-09 02:42:17,970 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:17,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 955940820, now seen corresponding path program 1 times [2018-12-09 02:42:17,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:17,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:17,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:18,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:18,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:18,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:18,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:18,026 INFO L87 Difference]: Start difference. First operand 2810 states and 6504 transitions. Second operand 7 states. [2018-12-09 02:42:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:18,224 INFO L93 Difference]: Finished difference Result 3247 states and 7538 transitions. [2018-12-09 02:42:18,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:18,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-09 02:42:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:18,226 INFO L225 Difference]: With dead ends: 3247 [2018-12-09 02:42:18,227 INFO L226 Difference]: Without dead ends: 3247 [2018-12-09 02:42:18,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2018-12-09 02:42:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2890. [2018-12-09 02:42:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-09 02:42:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 6729 transitions. [2018-12-09 02:42:18,252 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 6729 transitions. Word has length 84 [2018-12-09 02:42:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:18,253 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 6729 transitions. [2018-12-09 02:42:18,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 6729 transitions. [2018-12-09 02:42:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:18,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:18,255 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] [2018-12-09 02:42:18,255 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:18,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1237296374, now seen corresponding path program 1 times [2018-12-09 02:42:18,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:18,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:18,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:18,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:18,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:18,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:18,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:42:18,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:18,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:42:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:18,327 INFO L87 Difference]: Start difference. First operand 2890 states and 6729 transitions. Second operand 7 states. [2018-12-09 02:42:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:18,460 INFO L93 Difference]: Finished difference Result 3006 states and 6922 transitions. [2018-12-09 02:42:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:18,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-09 02:42:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:18,463 INFO L225 Difference]: With dead ends: 3006 [2018-12-09 02:42:18,463 INFO L226 Difference]: Without dead ends: 3006 [2018-12-09 02:42:18,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:42:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2018-12-09 02:42:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2728. [2018-12-09 02:42:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-12-09 02:42:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 6289 transitions. [2018-12-09 02:42:18,489 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 6289 transitions. Word has length 84 [2018-12-09 02:42:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:18,489 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 6289 transitions. [2018-12-09 02:42:18,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:42:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 6289 transitions. [2018-12-09 02:42:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:18,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:18,491 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] [2018-12-09 02:42:18,492 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:18,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1448647287, now seen corresponding path program 2 times [2018-12-09 02:42:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:18,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:42:18,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:42:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:42:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:18,584 INFO L87 Difference]: Start difference. First operand 2728 states and 6289 transitions. Second operand 8 states. [2018-12-09 02:42:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:18,726 INFO L93 Difference]: Finished difference Result 3112 states and 7156 transitions. [2018-12-09 02:42:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:42:18,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-09 02:42:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:18,729 INFO L225 Difference]: With dead ends: 3112 [2018-12-09 02:42:18,729 INFO L226 Difference]: Without dead ends: 3112 [2018-12-09 02:42:18,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 02:42:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-12-09 02:42:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2751. [2018-12-09 02:42:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2751 states. [2018-12-09 02:42:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 6330 transitions. [2018-12-09 02:42:18,749 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 6330 transitions. Word has length 84 [2018-12-09 02:42:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:18,749 INFO L480 AbstractCegarLoop]: Abstraction has 2751 states and 6330 transitions. [2018-12-09 02:42:18,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:42:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 6330 transitions. [2018-12-09 02:42:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:18,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:18,751 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] [2018-12-09 02:42:18,751 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:18,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1958816328, now seen corresponding path program 3 times [2018-12-09 02:42:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:18,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:18,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:42:18,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:18,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 02:42:18,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:42:18,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 02:42:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:42:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:42:18,860 INFO L87 Difference]: Start difference. First operand 2751 states and 6330 transitions. Second operand 11 states. [2018-12-09 02:42:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:19,558 INFO L93 Difference]: Finished difference Result 4763 states and 11016 transitions. [2018-12-09 02:42:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:42:19,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-09 02:42:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:42:19,562 INFO L225 Difference]: With dead ends: 4763 [2018-12-09 02:42:19,562 INFO L226 Difference]: Without dead ends: 3059 [2018-12-09 02:42:19,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 02:42:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2018-12-09 02:42:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2731. [2018-12-09 02:42:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-12-09 02:42:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 6288 transitions. [2018-12-09 02:42:19,590 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 6288 transitions. Word has length 84 [2018-12-09 02:42:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:42:19,590 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 6288 transitions. [2018-12-09 02:42:19,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 02:42:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 6288 transitions. [2018-12-09 02:42:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:42:19,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:42:19,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:42:19,592 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:42:19,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 10917176, now seen corresponding path program 4 times [2018-12-09 02:42:19,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:42:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:19,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:19,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:42:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:19,635 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:42:19,702 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 02:42:19,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:42:19 BasicIcfg [2018-12-09 02:42:19,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:42:19,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:42:19,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:42:19,703 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:42:19,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:41:59" (3/4) ... [2018-12-09 02:42:19,705 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:42:19,770 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4225544e-ab10-44a7-b923-d8cd0eaa01a6/bin-2019/utaipan/witness.graphml [2018-12-09 02:42:19,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:42:19,771 INFO L168 Benchmark]: Toolchain (without parser) took 20783.41 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 948.1 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 343.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:19,772 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-09 02:42:19,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:19,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:19,773 INFO L168 Benchmark]: Boogie Preprocessor took 19.46 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-09 02:42:19,773 INFO L168 Benchmark]: RCFGBuilder took 340.88 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:19,773 INFO L168 Benchmark]: TraceAbstraction took 20007.59 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 321.9 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:19,773 INFO L168 Benchmark]: Witness Printer took 67.46 ms. Allocated memory is still 3.3 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:42:19,774 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 314.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.46 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 340.88 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20007.59 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 321.9 MB. Max. memory is 11.5 GB. * Witness Printer took 67.46 ms. Allocated memory is still 3.3 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L776] -1 pthread_t t1645; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L777] FCALL, FORK -1 pthread_create(&t1645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] -1 pthread_t t1646; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L779] FCALL, FORK -1 pthread_create(&t1646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -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) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -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 [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -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 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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, 199 locations, 3 error locations. UNSAFE Result, 19.9s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8043 SDtfs, 9887 SDslu, 19304 SDs, 0 SdLazy, 7859 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 75 SyntacticMatches, 24 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 147550 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2132 NumberOfCodeBlocks, 2132 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2018 ConstructedInterpolants, 0 QuantifiedInterpolants, 380616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...