./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/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 adac677e86c3589742609fbf864b49e4d47efc96 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 07:05:57,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:05:57,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:05:57,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:05:57,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:05:57,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:05:57,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:05:57,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:05:57,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:05:57,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:05:57,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:05:57,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:05:57,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:05:57,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:05:57,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:05:57,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:05:57,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:05:57,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:05:57,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:05:57,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:05:57,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:05:57,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:05:57,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:05:57,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:05:57,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:05:57,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:05:57,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:05:57,593 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:05:57,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:05:57,594 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:05:57,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:05:57,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:05:57,595 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:05:57,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:05:57,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:05:57,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:05:57,597 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 07:05:57,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:05:57,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:05:57,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 07:05:57,607 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 07:05:57,608 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 07:05:57,608 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 07:05:57,608 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 07:05:57,608 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 07:05:57,608 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 07:05:57,608 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 07:05:57,608 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 07:05:57,609 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 07:05:57,609 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 07:05:57,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:05:57,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 07:05:57,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:05:57,610 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 07:05:57,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:05:57,610 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 07:05:57,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 07:05:57,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 07:05:57,611 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 07:05:57,611 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:05:57,611 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 07:05:57,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:05:57,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:05:57,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 07:05:57,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 07:05:57,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:05:57,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:05:57,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 07:05:57,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 07:05:57,612 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 07:05:57,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 07:05:57,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 07:05:57,613 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 07:05:57,613 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_32bf0ba0-11a6-4171-863c-0fbd7556c884/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 -> adac677e86c3589742609fbf864b49e4d47efc96 [2018-12-09 07:05:57,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:05:57,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:05:57,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:05:57,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:05:57,645 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:05:57,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i [2018-12-09 07:05:57,680 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/data/c80bc86b0/943daa7985d045328604dd1f42e67248/FLAG0650b2c6e [2018-12-09 07:05:58,071 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:05:58,071 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i [2018-12-09 07:05:58,080 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/data/c80bc86b0/943daa7985d045328604dd1f42e67248/FLAG0650b2c6e [2018-12-09 07:05:58,443 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/data/c80bc86b0/943daa7985d045328604dd1f42e67248 [2018-12-09 07:05:58,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:05:58,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:05:58,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:05:58,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:05:58,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:05:58,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf327e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58, skipping insertion in model container [2018-12-09 07:05:58,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:05:58,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:05:58,692 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:05:58,700 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:05:58,768 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:05:58,798 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:05:58,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58 WrapperNode [2018-12-09 07:05:58,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:05:58,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:05:58,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:05:58,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:05:58,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:05:58,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:05:58,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:05:58,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:05:58,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... [2018-12-09 07:05:58,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:05:58,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:05:58,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:05:58,846 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:05:58,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/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 07:05:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 07:05:58,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 07:05:58,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 07:05:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:05:58,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:05:58,878 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 07:05:59,165 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:05:59,165 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 07:05:59,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:05:59 BoogieIcfgContainer [2018-12-09 07:05:59,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:05:59,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 07:05:59,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 07:05:59,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 07:05:59,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:05:58" (1/3) ... [2018-12-09 07:05:59,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e25b7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:05:59, skipping insertion in model container [2018-12-09 07:05:59,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:58" (2/3) ... [2018-12-09 07:05:59,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e25b7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:05:59, skipping insertion in model container [2018-12-09 07:05:59,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:05:59" (3/3) ... [2018-12-09 07:05:59,170 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc_false-unreach-call.i [2018-12-09 07:05:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,195 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,196 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,196 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,196 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,207 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,207 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,208 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,208 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,208 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,208 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:05:59,216 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 07:05:59,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 07:05:59,221 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 07:05:59,230 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 07:05:59,245 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 07:05:59,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 07:05:59,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 07:05:59,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:05:59,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:05:59,246 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 07:05:59,246 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:05:59,246 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 07:05:59,253 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-09 07:06:00,361 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-09 07:06:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-09 07:06:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 07:06:00,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:00,371 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] [2018-12-09 07:06:00,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:00,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-09 07:06:00,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:00,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:00,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:00,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:00,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:00,537 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 07:06:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:06:00,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:00,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:06:00,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:06:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:06:00,551 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-09 07:06:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:00,906 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-09 07:06:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:06:00,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-09 07:06:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:01,025 INFO L225 Difference]: With dead ends: 47768 [2018-12-09 07:06:01,025 INFO L226 Difference]: Without dead ends: 34608 [2018-12-09 07:06:01,027 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 07:06:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-09 07:06:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-09 07:06:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-09 07:06:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-09 07:06:01,663 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-09 07:06:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:01,663 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-09 07:06:01,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:06:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-09 07:06:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 07:06:01,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:01,668 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 07:06:01,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:01,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:01,669 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-09 07:06:01,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:01,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:01,717 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 07:06:01,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:01,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:06:01,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:01,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:06:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:06:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:06:01,719 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-12-09 07:06:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:01,793 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-12-09 07:06:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:06:01,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 07:06:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:01,807 INFO L225 Difference]: With dead ends: 7170 [2018-12-09 07:06:01,807 INFO L226 Difference]: Without dead ends: 6324 [2018-12-09 07:06:01,808 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 07:06:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-12-09 07:06:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-12-09 07:06:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-12-09 07:06:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-12-09 07:06:01,962 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-12-09 07:06:01,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:01,963 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-12-09 07:06:01,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:06:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-12-09 07:06:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 07:06:01,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:01,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:01,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:01,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-12-09 07:06:01,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:01,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:02,031 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 07:06:02,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:02,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:06:02,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:02,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:06:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:06:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:06:02,032 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-12-09 07:06:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:02,218 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-12-09 07:06:02,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:06:02,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 07:06:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:02,239 INFO L225 Difference]: With dead ends: 12020 [2018-12-09 07:06:02,239 INFO L226 Difference]: Without dead ends: 11945 [2018-12-09 07:06:02,239 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 07:06:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-12-09 07:06:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-12-09 07:06:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-12-09 07:06:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-12-09 07:06:02,408 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-12-09 07:06:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:02,410 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-12-09 07:06:02,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:06:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-12-09 07:06:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 07:06:02,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:02,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:02,412 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:02,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-09 07:06:02,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:02,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:02,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:02,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:02,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:02,442 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 07:06:02,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:02,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:06:02,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:02,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:06:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:06:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:06:02,443 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-12-09 07:06:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:02,498 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-12-09 07:06:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:06:02,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 07:06:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:02,514 INFO L225 Difference]: With dead ends: 10985 [2018-12-09 07:06:02,514 INFO L226 Difference]: Without dead ends: 10981 [2018-12-09 07:06:02,514 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 07:06:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-12-09 07:06:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-12-09 07:06:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-12-09 07:06:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-12-09 07:06:02,626 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-12-09 07:06:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:02,626 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-12-09 07:06:02,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:06:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-12-09 07:06:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 07:06:02,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:02,627 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] [2018-12-09 07:06:02,627 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:02,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-09 07:06:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:02,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:02,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:02,701 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 07:06:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:02,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:02,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:02,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:02,702 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-12-09 07:06:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:02,944 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-12-09 07:06:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 07:06:02,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 07:06:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:02,959 INFO L225 Difference]: With dead ends: 11923 [2018-12-09 07:06:02,959 INFO L226 Difference]: Without dead ends: 11826 [2018-12-09 07:06:02,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 07:06:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-12-09 07:06:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-12-09 07:06:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-12-09 07:06:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-12-09 07:06:03,128 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-12-09 07:06:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:03,128 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-12-09 07:06:03,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-12-09 07:06:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 07:06:03,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:03,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:03,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:03,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-12-09 07:06:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:03,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:03,172 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 07:06:03,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:03,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:06:03,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:03,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:06:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:06:03,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:06:03,173 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-12-09 07:06:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:03,267 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-12-09 07:06:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:06:03,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 07:06:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:03,279 INFO L225 Difference]: With dead ends: 10900 [2018-12-09 07:06:03,280 INFO L226 Difference]: Without dead ends: 10900 [2018-12-09 07:06:03,280 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 07:06:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-12-09 07:06:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-12-09 07:06:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-12-09 07:06:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-12-09 07:06:03,390 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-12-09 07:06:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:03,390 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-12-09 07:06:03,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:06:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-12-09 07:06:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 07:06:03,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:03,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:03,395 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:03,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-12-09 07:06:03,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:03,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:03,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:03,434 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 07:06:03,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:03,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:03,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:03,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:03,435 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 6 states. [2018-12-09 07:06:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:03,765 INFO L93 Difference]: Finished difference Result 21763 states and 67780 transitions. [2018-12-09 07:06:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 07:06:03,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 07:06:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:03,789 INFO L225 Difference]: With dead ends: 21763 [2018-12-09 07:06:03,789 INFO L226 Difference]: Without dead ends: 21699 [2018-12-09 07:06:03,790 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 07:06:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21699 states. [2018-12-09 07:06:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21699 to 13157. [2018-12-09 07:06:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13157 states. [2018-12-09 07:06:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 40989 transitions. [2018-12-09 07:06:03,965 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 40989 transitions. Word has length 64 [2018-12-09 07:06:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:03,965 INFO L480 AbstractCegarLoop]: Abstraction has 13157 states and 40989 transitions. [2018-12-09 07:06:03,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 40989 transitions. [2018-12-09 07:06:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 07:06:03,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:03,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:03,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:03,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2018-12-09 07:06:03,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:03,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:03,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:03,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:03,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:04,065 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 07:06:04,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:04,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:06:04,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:04,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:06:04,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:06:04,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:06:04,066 INFO L87 Difference]: Start difference. First operand 13157 states and 40989 transitions. Second operand 5 states. [2018-12-09 07:06:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:04,293 INFO L93 Difference]: Finished difference Result 19275 states and 58649 transitions. [2018-12-09 07:06:04,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:06:04,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 07:06:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:04,314 INFO L225 Difference]: With dead ends: 19275 [2018-12-09 07:06:04,314 INFO L226 Difference]: Without dead ends: 19275 [2018-12-09 07:06:04,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2018-12-09 07:06:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 14988. [2018-12-09 07:06:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2018-12-09 07:06:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46076 transitions. [2018-12-09 07:06:04,490 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46076 transitions. Word has length 66 [2018-12-09 07:06:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:04,490 INFO L480 AbstractCegarLoop]: Abstraction has 14988 states and 46076 transitions. [2018-12-09 07:06:04,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:06:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46076 transitions. [2018-12-09 07:06:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 07:06:04,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:04,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:04,498 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:04,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2018-12-09 07:06:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:04,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:04,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:04,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:04,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:06:04,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:04,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:06:04,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:04,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:06:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:06:04,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:06:04,553 INFO L87 Difference]: Start difference. First operand 14988 states and 46076 transitions. Second operand 4 states. [2018-12-09 07:06:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:04,731 INFO L93 Difference]: Finished difference Result 18810 states and 57063 transitions. [2018-12-09 07:06:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:06:04,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 07:06:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:04,752 INFO L225 Difference]: With dead ends: 18810 [2018-12-09 07:06:04,752 INFO L226 Difference]: Without dead ends: 18810 [2018-12-09 07:06:04,752 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 07:06:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18810 states. [2018-12-09 07:06:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18810 to 15263. [2018-12-09 07:06:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15263 states. [2018-12-09 07:06:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15263 states to 15263 states and 46864 transitions. [2018-12-09 07:06:04,930 INFO L78 Accepts]: Start accepts. Automaton has 15263 states and 46864 transitions. Word has length 66 [2018-12-09 07:06:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:04,930 INFO L480 AbstractCegarLoop]: Abstraction has 15263 states and 46864 transitions. [2018-12-09 07:06:04,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:06:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 15263 states and 46864 transitions. [2018-12-09 07:06:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 07:06:04,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:04,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:04,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:04,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:04,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2018-12-09 07:06:04,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:04,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:04,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:04,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:04,958 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 07:06:04,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:04,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:06:04,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:04,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:06:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:06:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:06:04,959 INFO L87 Difference]: Start difference. First operand 15263 states and 46864 transitions. Second operand 3 states. [2018-12-09 07:06:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:05,080 INFO L93 Difference]: Finished difference Result 15699 states and 48054 transitions. [2018-12-09 07:06:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:06:05,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 07:06:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:05,097 INFO L225 Difference]: With dead ends: 15699 [2018-12-09 07:06:05,098 INFO L226 Difference]: Without dead ends: 15699 [2018-12-09 07:06:05,098 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 07:06:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15699 states. [2018-12-09 07:06:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15699 to 15481. [2018-12-09 07:06:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15481 states. [2018-12-09 07:06:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15481 states to 15481 states and 47432 transitions. [2018-12-09 07:06:05,285 INFO L78 Accepts]: Start accepts. Automaton has 15481 states and 47432 transitions. Word has length 66 [2018-12-09 07:06:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:05,286 INFO L480 AbstractCegarLoop]: Abstraction has 15481 states and 47432 transitions. [2018-12-09 07:06:05,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:06:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15481 states and 47432 transitions. [2018-12-09 07:06:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:05,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:05,295 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] [2018-12-09 07:06:05,295 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:05,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2018-12-09 07:06:05,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:05,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:05,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:05,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:05,346 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 07:06:05,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:05,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:05,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:05,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:05,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:05,347 INFO L87 Difference]: Start difference. First operand 15481 states and 47432 transitions. Second operand 6 states. [2018-12-09 07:06:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:05,844 INFO L93 Difference]: Finished difference Result 18701 states and 56367 transitions. [2018-12-09 07:06:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:06:05,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 07:06:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:05,862 INFO L225 Difference]: With dead ends: 18701 [2018-12-09 07:06:05,862 INFO L226 Difference]: Without dead ends: 18701 [2018-12-09 07:06:05,863 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 07:06:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18701 states. [2018-12-09 07:06:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18701 to 17377. [2018-12-09 07:06:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2018-12-09 07:06:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 52698 transitions. [2018-12-09 07:06:06,041 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 52698 transitions. Word has length 68 [2018-12-09 07:06:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:06,041 INFO L480 AbstractCegarLoop]: Abstraction has 17377 states and 52698 transitions. [2018-12-09 07:06:06,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 52698 transitions. [2018-12-09 07:06:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:06,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:06,052 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] [2018-12-09 07:06:06,052 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:06,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2018-12-09 07:06:06,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:06,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:06,117 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 07:06:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:06,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:06,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:06,118 INFO L87 Difference]: Start difference. First operand 17377 states and 52698 transitions. Second operand 6 states. [2018-12-09 07:06:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:06,355 INFO L93 Difference]: Finished difference Result 19150 states and 57148 transitions. [2018-12-09 07:06:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:06:06,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 07:06:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:06,375 INFO L225 Difference]: With dead ends: 19150 [2018-12-09 07:06:06,375 INFO L226 Difference]: Without dead ends: 19150 [2018-12-09 07:06:06,375 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 07:06:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2018-12-09 07:06:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 17509. [2018-12-09 07:06:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2018-12-09 07:06:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 52637 transitions. [2018-12-09 07:06:06,560 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 52637 transitions. Word has length 68 [2018-12-09 07:06:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:06,560 INFO L480 AbstractCegarLoop]: Abstraction has 17509 states and 52637 transitions. [2018-12-09 07:06:06,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 52637 transitions. [2018-12-09 07:06:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:06,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:06,570 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] [2018-12-09 07:06:06,570 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:06,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:06,571 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2018-12-09 07:06:06,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:06,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:06,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:06,629 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 07:06:06,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:06,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:06:06,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:06,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:06:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:06:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:06:06,630 INFO L87 Difference]: Start difference. First operand 17509 states and 52637 transitions. Second operand 5 states. [2018-12-09 07:06:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:06,821 INFO L93 Difference]: Finished difference Result 21589 states and 64352 transitions. [2018-12-09 07:06:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:06:06,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 07:06:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:06,843 INFO L225 Difference]: With dead ends: 21589 [2018-12-09 07:06:06,843 INFO L226 Difference]: Without dead ends: 21589 [2018-12-09 07:06:06,844 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 07:06:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21589 states. [2018-12-09 07:06:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21589 to 18595. [2018-12-09 07:06:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18595 states. [2018-12-09 07:06:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18595 states to 18595 states and 55396 transitions. [2018-12-09 07:06:07,029 INFO L78 Accepts]: Start accepts. Automaton has 18595 states and 55396 transitions. Word has length 68 [2018-12-09 07:06:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:07,029 INFO L480 AbstractCegarLoop]: Abstraction has 18595 states and 55396 transitions. [2018-12-09 07:06:07,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:06:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 18595 states and 55396 transitions. [2018-12-09 07:06:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:07,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:07,039 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] [2018-12-09 07:06:07,039 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:07,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2018-12-09 07:06:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:07,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:07,075 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 07:06:07,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:07,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:06:07,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:07,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:06:07,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:06:07,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:06:07,076 INFO L87 Difference]: Start difference. First operand 18595 states and 55396 transitions. Second operand 5 states. [2018-12-09 07:06:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:07,346 INFO L93 Difference]: Finished difference Result 27216 states and 80202 transitions. [2018-12-09 07:06:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:06:07,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 07:06:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:07,376 INFO L225 Difference]: With dead ends: 27216 [2018-12-09 07:06:07,376 INFO L226 Difference]: Without dead ends: 27216 [2018-12-09 07:06:07,376 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 07:06:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27216 states. [2018-12-09 07:06:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27216 to 21398. [2018-12-09 07:06:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21398 states. [2018-12-09 07:06:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21398 states to 21398 states and 63361 transitions. [2018-12-09 07:06:07,628 INFO L78 Accepts]: Start accepts. Automaton has 21398 states and 63361 transitions. Word has length 68 [2018-12-09 07:06:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:07,628 INFO L480 AbstractCegarLoop]: Abstraction has 21398 states and 63361 transitions. [2018-12-09 07:06:07,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:06:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states and 63361 transitions. [2018-12-09 07:06:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:07,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:07,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:07,639 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:07,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-12-09 07:06:07,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:07,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:07,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:07,698 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 07:06:07,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:07,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:07,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:07,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:07,698 INFO L87 Difference]: Start difference. First operand 21398 states and 63361 transitions. Second operand 6 states. [2018-12-09 07:06:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:08,111 INFO L93 Difference]: Finished difference Result 35018 states and 103808 transitions. [2018-12-09 07:06:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:06:08,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 07:06:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:08,151 INFO L225 Difference]: With dead ends: 35018 [2018-12-09 07:06:08,151 INFO L226 Difference]: Without dead ends: 35018 [2018-12-09 07:06:08,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:06:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2018-12-09 07:06:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 27706. [2018-12-09 07:06:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27706 states. [2018-12-09 07:06:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27706 states to 27706 states and 83160 transitions. [2018-12-09 07:06:08,497 INFO L78 Accepts]: Start accepts. Automaton has 27706 states and 83160 transitions. Word has length 68 [2018-12-09 07:06:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:08,497 INFO L480 AbstractCegarLoop]: Abstraction has 27706 states and 83160 transitions. [2018-12-09 07:06:08,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 27706 states and 83160 transitions. [2018-12-09 07:06:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:08,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:08,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, 1] [2018-12-09 07:06:08,512 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:08,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-12-09 07:06:08,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:08,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:08,549 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 07:06:08,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:08,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:06:08,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:08,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:06:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:06:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:06:08,550 INFO L87 Difference]: Start difference. First operand 27706 states and 83160 transitions. Second operand 4 states. [2018-12-09 07:06:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:08,877 INFO L93 Difference]: Finished difference Result 30486 states and 90397 transitions. [2018-12-09 07:06:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:06:08,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 07:06:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:08,916 INFO L225 Difference]: With dead ends: 30486 [2018-12-09 07:06:08,916 INFO L226 Difference]: Without dead ends: 29906 [2018-12-09 07:06:08,917 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 07:06:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2018-12-09 07:06:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2018-12-09 07:06:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-12-09 07:06:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2018-12-09 07:06:09,314 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2018-12-09 07:06:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:09,315 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2018-12-09 07:06:09,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:06:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2018-12-09 07:06:09,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:09,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:09,328 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] [2018-12-09 07:06:09,328 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:09,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-12-09 07:06:09,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:09,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:09,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:09,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:09,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:09,405 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 07:06:09,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 07:06:09,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:09,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 07:06:09,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 07:06:09,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:06:09,406 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2018-12-09 07:06:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:09,803 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2018-12-09 07:06:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 07:06:09,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-09 07:06:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:09,843 INFO L225 Difference]: With dead ends: 34850 [2018-12-09 07:06:09,843 INFO L226 Difference]: Without dead ends: 34850 [2018-12-09 07:06:09,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 07:06:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2018-12-09 07:06:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2018-12-09 07:06:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-12-09 07:06:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2018-12-09 07:06:10,191 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2018-12-09 07:06:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:10,191 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2018-12-09 07:06:10,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 07:06:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2018-12-09 07:06:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 07:06:10,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:10,205 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] [2018-12-09 07:06:10,205 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:10,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:10,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-12-09 07:06:10,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:10,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:10,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:06:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:06:10,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:10,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:06:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:06:10,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:06:10,236 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2018-12-09 07:06:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:10,276 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2018-12-09 07:06:10,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:06:10,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 07:06:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:10,280 INFO L225 Difference]: With dead ends: 7664 [2018-12-09 07:06:10,280 INFO L226 Difference]: Without dead ends: 5913 [2018-12-09 07:06:10,281 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 07:06:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2018-12-09 07:06:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2018-12-09 07:06:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2018-12-09 07:06:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2018-12-09 07:06:10,316 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2018-12-09 07:06:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:10,316 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2018-12-09 07:06:10,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:06:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2018-12-09 07:06:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 07:06:10,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:10,320 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] [2018-12-09 07:06:10,320 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:10,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash -427244149, now seen corresponding path program 1 times [2018-12-09 07:06:10,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:10,370 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 07:06:10,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:10,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:10,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:10,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:10,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:10,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:10,371 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 6 states. [2018-12-09 07:06:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:10,518 INFO L93 Difference]: Finished difference Result 6778 states and 15982 transitions. [2018-12-09 07:06:10,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:06:10,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 07:06:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:10,522 INFO L225 Difference]: With dead ends: 6778 [2018-12-09 07:06:10,522 INFO L226 Difference]: Without dead ends: 6746 [2018-12-09 07:06:10,522 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 07:06:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2018-12-09 07:06:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 5276. [2018-12-09 07:06:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5276 states. [2018-12-09 07:06:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 12536 transitions. [2018-12-09 07:06:10,563 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 12536 transitions. Word has length 83 [2018-12-09 07:06:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:10,563 INFO L480 AbstractCegarLoop]: Abstraction has 5276 states and 12536 transitions. [2018-12-09 07:06:10,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 12536 transitions. [2018-12-09 07:06:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 07:06:10,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:10,566 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] [2018-12-09 07:06:10,566 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:10,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2070771788, now seen corresponding path program 1 times [2018-12-09 07:06:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:10,608 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 07:06:10,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:10,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:06:10,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:10,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:06:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:06:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:06:10,609 INFO L87 Difference]: Start difference. First operand 5276 states and 12536 transitions. Second operand 7 states. [2018-12-09 07:06:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:10,844 INFO L93 Difference]: Finished difference Result 8217 states and 19889 transitions. [2018-12-09 07:06:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 07:06:10,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-09 07:06:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:10,849 INFO L225 Difference]: With dead ends: 8217 [2018-12-09 07:06:10,850 INFO L226 Difference]: Without dead ends: 8217 [2018-12-09 07:06:10,850 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 07:06:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-12-09 07:06:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 5921. [2018-12-09 07:06:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5921 states. [2018-12-09 07:06:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 14180 transitions. [2018-12-09 07:06:10,902 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 14180 transitions. Word has length 83 [2018-12-09 07:06:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:10,902 INFO L480 AbstractCegarLoop]: Abstraction has 5921 states and 14180 transitions. [2018-12-09 07:06:10,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:06:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 14180 transitions. [2018-12-09 07:06:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 07:06:10,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:10,906 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] [2018-12-09 07:06:10,907 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:10,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:10,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1336691827, now seen corresponding path program 1 times [2018-12-09 07:06:10,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:10,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:10,954 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 07:06:10,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:10,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:10,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:10,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:10,955 INFO L87 Difference]: Start difference. First operand 5921 states and 14180 transitions. Second operand 6 states. [2018-12-09 07:06:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:11,227 INFO L93 Difference]: Finished difference Result 6595 states and 15795 transitions. [2018-12-09 07:06:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:06:11,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 07:06:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:11,234 INFO L225 Difference]: With dead ends: 6595 [2018-12-09 07:06:11,234 INFO L226 Difference]: Without dead ends: 6595 [2018-12-09 07:06:11,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:06:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2018-12-09 07:06:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 5382. [2018-12-09 07:06:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5382 states. [2018-12-09 07:06:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 12786 transitions. [2018-12-09 07:06:11,295 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 12786 transitions. Word has length 83 [2018-12-09 07:06:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:11,295 INFO L480 AbstractCegarLoop]: Abstraction has 5382 states and 12786 transitions. [2018-12-09 07:06:11,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 12786 transitions. [2018-12-09 07:06:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 07:06:11,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:11,300 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] [2018-12-09 07:06:11,300 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:11,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -858977808, now seen corresponding path program 1 times [2018-12-09 07:06:11,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:11,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:11,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:06:11,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:11,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:11,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:11,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:11,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:11,334 INFO L87 Difference]: Start difference. First operand 5382 states and 12786 transitions. Second operand 6 states. [2018-12-09 07:06:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:11,473 INFO L93 Difference]: Finished difference Result 6387 states and 15122 transitions. [2018-12-09 07:06:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:06:11,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 07:06:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:11,478 INFO L225 Difference]: With dead ends: 6387 [2018-12-09 07:06:11,478 INFO L226 Difference]: Without dead ends: 6387 [2018-12-09 07:06:11,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2018-12-09 07:06:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 5243. [2018-12-09 07:06:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2018-12-09 07:06:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 12432 transitions. [2018-12-09 07:06:11,526 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 12432 transitions. Word has length 83 [2018-12-09 07:06:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:11,527 INFO L480 AbstractCegarLoop]: Abstraction has 5243 states and 12432 transitions. [2018-12-09 07:06:11,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 12432 transitions. [2018-12-09 07:06:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 07:06:11,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:11,530 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] [2018-12-09 07:06:11,530 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:11,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 510429518, now seen corresponding path program 1 times [2018-12-09 07:06:11,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:11,584 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 07:06:11,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:11,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:11,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:11,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:11,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:11,585 INFO L87 Difference]: Start difference. First operand 5243 states and 12432 transitions. Second operand 6 states. [2018-12-09 07:06:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:11,658 INFO L93 Difference]: Finished difference Result 4891 states and 11280 transitions. [2018-12-09 07:06:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:06:11,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 07:06:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:11,661 INFO L225 Difference]: With dead ends: 4891 [2018-12-09 07:06:11,662 INFO L226 Difference]: Without dead ends: 4891 [2018-12-09 07:06:11,662 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 07:06:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4891 states. [2018-12-09 07:06:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4891 to 2915. [2018-12-09 07:06:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-12-09 07:06:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 6735 transitions. [2018-12-09 07:06:11,689 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 6735 transitions. Word has length 83 [2018-12-09 07:06:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:11,689 INFO L480 AbstractCegarLoop]: Abstraction has 2915 states and 6735 transitions. [2018-12-09 07:06:11,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 6735 transitions. [2018-12-09 07:06:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:06:11,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:11,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:11,691 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:11,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1696141667, now seen corresponding path program 1 times [2018-12-09 07:06:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:11,752 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 07:06:11,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:11,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:06:11,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:11,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:06:11,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:06:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:11,753 INFO L87 Difference]: Start difference. First operand 2915 states and 6735 transitions. Second operand 6 states. [2018-12-09 07:06:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:11,844 INFO L93 Difference]: Finished difference Result 3309 states and 7523 transitions. [2018-12-09 07:06:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:06:11,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-09 07:06:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:11,846 INFO L225 Difference]: With dead ends: 3309 [2018-12-09 07:06:11,846 INFO L226 Difference]: Without dead ends: 3233 [2018-12-09 07:06:11,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:06:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-12-09 07:06:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 2655. [2018-12-09 07:06:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2018-12-09 07:06:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 6061 transitions. [2018-12-09 07:06:11,864 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 6061 transitions. Word has length 85 [2018-12-09 07:06:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:11,864 INFO L480 AbstractCegarLoop]: Abstraction has 2655 states and 6061 transitions. [2018-12-09 07:06:11,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:06:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 6061 transitions. [2018-12-09 07:06:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:06:11,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:11,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:11,866 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:11,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1441405122, now seen corresponding path program 1 times [2018-12-09 07:06:11,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:11,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:06:11,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:11,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:06:11,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:11,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:06:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:06:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:06:11,932 INFO L87 Difference]: Start difference. First operand 2655 states and 6061 transitions. Second operand 7 states. [2018-12-09 07:06:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:12,045 INFO L93 Difference]: Finished difference Result 3147 states and 7166 transitions. [2018-12-09 07:06:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:06:12,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-09 07:06:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:12,047 INFO L225 Difference]: With dead ends: 3147 [2018-12-09 07:06:12,047 INFO L226 Difference]: Without dead ends: 3147 [2018-12-09 07:06:12,047 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 07:06:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-12-09 07:06:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2736. [2018-12-09 07:06:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2018-12-09 07:06:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 6211 transitions. [2018-12-09 07:06:12,067 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 6211 transitions. Word has length 85 [2018-12-09 07:06:12,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:12,067 INFO L480 AbstractCegarLoop]: Abstraction has 2736 states and 6211 transitions. [2018-12-09 07:06:12,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:06:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 6211 transitions. [2018-12-09 07:06:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:06:12,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:12,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:12,069 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:12,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:12,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1966058493, now seen corresponding path program 1 times [2018-12-09 07:06:12,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:12,137 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 07:06:12,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:12,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 07:06:12,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:12,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 07:06:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 07:06:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:06:12,138 INFO L87 Difference]: Start difference. First operand 2736 states and 6211 transitions. Second operand 9 states. [2018-12-09 07:06:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:12,257 INFO L93 Difference]: Finished difference Result 6987 states and 16014 transitions. [2018-12-09 07:06:12,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 07:06:12,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-12-09 07:06:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:12,259 INFO L225 Difference]: With dead ends: 6987 [2018-12-09 07:06:12,259 INFO L226 Difference]: Without dead ends: 2099 [2018-12-09 07:06:12,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-09 07:06:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2018-12-09 07:06:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2099. [2018-12-09 07:06:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2018-12-09 07:06:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 4798 transitions. [2018-12-09 07:06:12,271 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 4798 transitions. Word has length 85 [2018-12-09 07:06:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:12,271 INFO L480 AbstractCegarLoop]: Abstraction has 2099 states and 4798 transitions. [2018-12-09 07:06:12,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 07:06:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 4798 transitions. [2018-12-09 07:06:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:06:12,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:12,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:12,273 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 228213864, now seen corresponding path program 2 times [2018-12-09 07:06:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:06:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:12,318 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 07:06:12,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:06:12,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:12,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:06:12,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:06:12,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:06:12,319 INFO L87 Difference]: Start difference. First operand 2099 states and 4798 transitions. Second operand 5 states. [2018-12-09 07:06:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:12,340 INFO L93 Difference]: Finished difference Result 2099 states and 4782 transitions. [2018-12-09 07:06:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:06:12,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-09 07:06:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:12,342 INFO L225 Difference]: With dead ends: 2099 [2018-12-09 07:06:12,342 INFO L226 Difference]: Without dead ends: 2099 [2018-12-09 07:06:12,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:06:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2018-12-09 07:06:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1693. [2018-12-09 07:06:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2018-12-09 07:06:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3855 transitions. [2018-12-09 07:06:12,360 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3855 transitions. Word has length 85 [2018-12-09 07:06:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:12,360 INFO L480 AbstractCegarLoop]: Abstraction has 1693 states and 3855 transitions. [2018-12-09 07:06:12,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:06:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3855 transitions. [2018-12-09 07:06:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:06:12,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:12,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:12,362 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:12,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1115717545, now seen corresponding path program 2 times [2018-12-09 07:06:12,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:06:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:06:12,466 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 07:06:12,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:06:12,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 07:06:12,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:06:12,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 07:06:12,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 07:06:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 07:06:12,467 INFO L87 Difference]: Start difference. First operand 1693 states and 3855 transitions. Second operand 11 states. [2018-12-09 07:06:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:06:12,937 INFO L93 Difference]: Finished difference Result 3268 states and 7492 transitions. [2018-12-09 07:06:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 07:06:12,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-09 07:06:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:06:12,939 INFO L225 Difference]: With dead ends: 3268 [2018-12-09 07:06:12,939 INFO L226 Difference]: Without dead ends: 1920 [2018-12-09 07:06:12,939 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 07:06:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2018-12-09 07:06:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1726. [2018-12-09 07:06:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-12-09 07:06:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3878 transitions. [2018-12-09 07:06:12,950 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3878 transitions. Word has length 85 [2018-12-09 07:06:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:06:12,950 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 3878 transitions. [2018-12-09 07:06:12,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 07:06:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3878 transitions. [2018-12-09 07:06:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:06:12,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:06:12,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:06:12,951 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:06:12,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:06:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1515525577, now seen corresponding path program 3 times [2018-12-09 07:06:12,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:06:12,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:06:12,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:06:12,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:06:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:06:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:06:12,996 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 07:06:13,068 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 07:06:13,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:06:13 BasicIcfg [2018-12-09 07:06:13,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 07:06:13,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:06:13,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:06:13,070 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:06:13,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:05:59" (3/4) ... [2018-12-09 07:06:13,072 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 07:06:13,136 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32bf0ba0-11a6-4171-863c-0fbd7556c884/bin-2019/utaipan/witness.graphml [2018-12-09 07:06:13,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:06:13,137 INFO L168 Benchmark]: Toolchain (without parser) took 14687.88 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 947.0 MB in the beginning and 1.6 GB in the end (delta: -667.7 MB). Peak memory consumption was 830.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:06:13,138 INFO L168 Benchmark]: CDTParser took 0.13 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 07:06:13,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-09 07:06:13,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.24 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 07:06:13,138 INFO L168 Benchmark]: Boogie Preprocessor took 17.60 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 07:06:13,138 INFO L168 Benchmark]: RCFGBuilder took 320.18 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-12-09 07:06:13,139 INFO L168 Benchmark]: TraceAbstraction took 13903.21 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -603.7 MB). Peak memory consumption was 783.5 MB. Max. memory is 11.5 GB. [2018-12-09 07:06:13,139 INFO L168 Benchmark]: Witness Printer took 66.67 ms. Allocated memory is still 2.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-12-09 07:06:13,140 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.13 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 346.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.24 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 17.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 320.18 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13903.21 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -603.7 MB). Peak memory consumption was 783.5 MB. Max. memory is 11.5 GB. * Witness Printer took 66.67 ms. Allocated memory is still 2.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1655; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1655, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1656; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1656, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 13.8s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7549 SDtfs, 8499 SDslu, 17217 SDs, 0 SdLazy, 6350 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 68 SyntacticMatches, 19 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29288occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 76666 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 362381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...