./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/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 6e0509072627462b1b2a882e317e2a071d382ef5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:18:00,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:18:00,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:18:00,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:18:00,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:18:00,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:18:00,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:18:00,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:18:00,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:18:00,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:18:00,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:18:00,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:18:00,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:18:00,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:18:00,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:18:00,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:18:00,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:18:00,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:18:00,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:18:00,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:18:00,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:18:00,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:18:00,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:18:00,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:18:00,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:18:00,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:18:00,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:18:00,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:18:00,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:18:00,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:18:00,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:18:00,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:18:00,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:18:00,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:18:00,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:18:00,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:18:00,213 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:18:00,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:18:00,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:18:00,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:18:00,224 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:18:00,224 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:18:00,225 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:18:00,225 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:18:00,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:18:00,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:18:00,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:18:00,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:18:00,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:18:00,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:18:00,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:18:00,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:18:00,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:18:00,228 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_4479e412-2e8c-43e8-b189-b9b5e9079624/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 -> 6e0509072627462b1b2a882e317e2a071d382ef5 [2018-12-09 19:18:00,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:18:00,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:18:00,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:18:00,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:18:00,260 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:18:00,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i [2018-12-09 19:18:00,295 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/data/6aee7df29/e4d95a5b8ce049ca87da06d9bd0846b7/FLAG32e6a419d [2018-12-09 19:18:00,614 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:18:00,615 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i [2018-12-09 19:18:00,624 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/data/6aee7df29/e4d95a5b8ce049ca87da06d9bd0846b7/FLAG32e6a419d [2018-12-09 19:18:00,635 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/data/6aee7df29/e4d95a5b8ce049ca87da06d9bd0846b7 [2018-12-09 19:18:00,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:18:00,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:18:00,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:18:00,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:18:00,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:18:00,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:00,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00, skipping insertion in model container [2018-12-09 19:18:00,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:00,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:18:00,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:18:00,849 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:18:00,857 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:18:00,940 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:18:00,969 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:18:00,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00 WrapperNode [2018-12-09 19:18:00,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:18:00,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:18:00,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:18:00,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:18:00,975 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:18:00" (1/1) ... [2018-12-09 19:18:00,986 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:18:00" (1/1) ... [2018-12-09 19:18:01,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:18:01,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:18:01,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:18:01,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:18:01,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... [2018-12-09 19:18:01,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:18:01,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:18:01,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:18:01,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:18:01,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/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 19:18:01,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:18:01,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:18:01,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:18:01,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:18:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:18:01,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:18:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:18:01,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:18:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:18:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:18:01,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:18:01,070 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 19:18:01,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:18:01,462 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:18:01,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:18:01 BoogieIcfgContainer [2018-12-09 19:18:01,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:18:01,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:18:01,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:18:01,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:18:01,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:18:00" (1/3) ... [2018-12-09 19:18:01,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f21e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:18:01, skipping insertion in model container [2018-12-09 19:18:01,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:18:00" (2/3) ... [2018-12-09 19:18:01,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f21e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:18:01, skipping insertion in model container [2018-12-09 19:18:01,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:18:01" (3/3) ... [2018-12-09 19:18:01,467 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt_false-unreach-call.i [2018-12-09 19:18:01,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,492 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,492 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,496 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:18:01,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:18:01,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:18:01,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:18:01,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:18:01,554 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:18:01,554 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:18:01,555 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:18:01,555 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:18:01,555 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:18:01,555 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:18:01,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:18:01,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:18:01,564 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-09 19:18:06,539 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-09 19:18:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-09 19:18:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 19:18:06,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:06,546 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] [2018-12-09 19:18:06,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:06,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 210414996, now seen corresponding path program 1 times [2018-12-09 19:18:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:06,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:06,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:06,684 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 19:18:06,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:06,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:06,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:06,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:06,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:06,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:06,699 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-09 19:18:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:07,628 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-09 19:18:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:18:07,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 19:18:07,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:08,071 INFO L225 Difference]: With dead ends: 142996 [2018-12-09 19:18:08,071 INFO L226 Difference]: Without dead ends: 126812 [2018-12-09 19:18:08,072 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 19:18:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-09 19:18:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-09 19:18:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-09 19:18:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-09 19:18:11,986 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-09 19:18:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:11,987 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-09 19:18:11,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-09 19:18:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 19:18:11,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:11,990 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] [2018-12-09 19:18:11,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:11,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -746847349, now seen corresponding path program 1 times [2018-12-09 19:18:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:11,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:11,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:12,057 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 19:18:12,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:12,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:12,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:12,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:12,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:12,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:12,059 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-09 19:18:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:13,200 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-09 19:18:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:18:13,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 19:18:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:13,692 INFO L225 Difference]: With dead ends: 201246 [2018-12-09 19:18:13,692 INFO L226 Difference]: Without dead ends: 201086 [2018-12-09 19:18:13,693 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 19:18:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-09 19:18:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-09 19:18:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-09 19:18:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-09 19:18:17,010 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-09 19:18:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:17,011 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-09 19:18:17,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-09 19:18:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:18:17,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:17,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:17,015 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:17,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash 56283897, now seen corresponding path program 1 times [2018-12-09 19:18:17,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:17,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:17,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:17,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:17,058 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 19:18:17,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:17,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:17,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:17,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:17,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:17,059 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-09 19:18:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:17,142 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-09 19:18:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:18:17,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 19:18:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:17,179 INFO L225 Difference]: With dead ends: 26128 [2018-12-09 19:18:17,179 INFO L226 Difference]: Without dead ends: 24431 [2018-12-09 19:18:17,180 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 19:18:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-09 19:18:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-09 19:18:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-09 19:18:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-09 19:18:17,488 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-09 19:18:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:17,489 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-09 19:18:17,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-09 19:18:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:18:17,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:17,492 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] [2018-12-09 19:18:17,493 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:17,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -677750709, now seen corresponding path program 1 times [2018-12-09 19:18:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:17,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:18:17,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:17,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:17,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:17,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:17,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:17,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:17,544 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-09 19:18:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:17,795 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-09 19:18:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:18:17,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 19:18:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:17,842 INFO L225 Difference]: With dead ends: 33039 [2018-12-09 19:18:17,842 INFO L226 Difference]: Without dead ends: 33039 [2018-12-09 19:18:17,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:18:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-09 19:18:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-09 19:18:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-09 19:18:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-09 19:18:18,291 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-09 19:18:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-09 19:18:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-09 19:18:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:18:18,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:18,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] [2018-12-09 19:18:18,295 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:18,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1045055487, now seen corresponding path program 1 times [2018-12-09 19:18:18,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:18,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:18,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:18,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:18,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:18,348 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 19:18:18,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:18,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:18,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:18,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:18,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:18,349 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 4 states. [2018-12-09 19:18:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:18,894 INFO L93 Difference]: Finished difference Result 34248 states and 114231 transitions. [2018-12-09 19:18:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:18:18,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 19:18:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:18,941 INFO L225 Difference]: With dead ends: 34248 [2018-12-09 19:18:18,941 INFO L226 Difference]: Without dead ends: 34248 [2018-12-09 19:18:18,942 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 19:18:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2018-12-09 19:18:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 31773. [2018-12-09 19:18:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31773 states. [2018-12-09 19:18:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31773 states to 31773 states and 107008 transitions. [2018-12-09 19:18:19,341 INFO L78 Accepts]: Start accepts. Automaton has 31773 states and 107008 transitions. Word has length 58 [2018-12-09 19:18:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:19,341 INFO L480 AbstractCegarLoop]: Abstraction has 31773 states and 107008 transitions. [2018-12-09 19:18:19,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 31773 states and 107008 transitions. [2018-12-09 19:18:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:18:19,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:19,345 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] [2018-12-09 19:18:19,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:19,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1896602112, now seen corresponding path program 1 times [2018-12-09 19:18:19,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:19,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:19,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:19,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:19,402 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 19:18:19,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:19,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:18:19,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:19,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:18:19,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:18:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:18:19,403 INFO L87 Difference]: Start difference. First operand 31773 states and 107008 transitions. Second operand 6 states. [2018-12-09 19:18:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:20,412 INFO L93 Difference]: Finished difference Result 46397 states and 155016 transitions. [2018-12-09 19:18:20,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:18:20,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 19:18:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:20,476 INFO L225 Difference]: With dead ends: 46397 [2018-12-09 19:18:20,476 INFO L226 Difference]: Without dead ends: 46365 [2018-12-09 19:18:20,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:18:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2018-12-09 19:18:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 37325. [2018-12-09 19:18:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2018-12-09 19:18:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 124568 transitions. [2018-12-09 19:18:20,984 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 124568 transitions. Word has length 58 [2018-12-09 19:18:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:20,984 INFO L480 AbstractCegarLoop]: Abstraction has 37325 states and 124568 transitions. [2018-12-09 19:18:20,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:18:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 124568 transitions. [2018-12-09 19:18:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:18:20,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:20,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:20,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:20,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash -687839314, now seen corresponding path program 1 times [2018-12-09 19:18:20,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:21,044 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 19:18:21,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:21,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:21,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:21,045 INFO L87 Difference]: Start difference. First operand 37325 states and 124568 transitions. Second operand 5 states. [2018-12-09 19:18:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:21,075 INFO L93 Difference]: Finished difference Result 6357 states and 16810 transitions. [2018-12-09 19:18:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:18:21,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-09 19:18:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:21,080 INFO L225 Difference]: With dead ends: 6357 [2018-12-09 19:18:21,080 INFO L226 Difference]: Without dead ends: 5185 [2018-12-09 19:18:21,080 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 19:18:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2018-12-09 19:18:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 4549. [2018-12-09 19:18:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-12-09 19:18:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 11874 transitions. [2018-12-09 19:18:21,120 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 11874 transitions. Word has length 72 [2018-12-09 19:18:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:21,120 INFO L480 AbstractCegarLoop]: Abstraction has 4549 states and 11874 transitions. [2018-12-09 19:18:21,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 11874 transitions. [2018-12-09 19:18:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:21,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:21,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:21,125 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:21,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:21,125 INFO L82 PathProgramCache]: Analyzing trace with hash -45620389, now seen corresponding path program 1 times [2018-12-09 19:18:21,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:21,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:21,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:21,175 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 19:18:21,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:21,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:18:21,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:21,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:18:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:18:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:18:21,176 INFO L87 Difference]: Start difference. First operand 4549 states and 11874 transitions. Second operand 6 states. [2018-12-09 19:18:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:21,574 INFO L93 Difference]: Finished difference Result 5873 states and 15097 transitions. [2018-12-09 19:18:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:18:21,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-09 19:18:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:21,578 INFO L225 Difference]: With dead ends: 5873 [2018-12-09 19:18:21,578 INFO L226 Difference]: Without dead ends: 5873 [2018-12-09 19:18:21,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:18:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5873 states. [2018-12-09 19:18:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5873 to 4775. [2018-12-09 19:18:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2018-12-09 19:18:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 12453 transitions. [2018-12-09 19:18:21,614 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 12453 transitions. Word has length 107 [2018-12-09 19:18:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:21,615 INFO L480 AbstractCegarLoop]: Abstraction has 4775 states and 12453 transitions. [2018-12-09 19:18:21,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:18:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 12453 transitions. [2018-12-09 19:18:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:21,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:21,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:21,618 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:21,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1503837772, now seen corresponding path program 1 times [2018-12-09 19:18:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:21,676 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 19:18:21,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:21,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:21,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:21,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:21,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:21,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:21,677 INFO L87 Difference]: Start difference. First operand 4775 states and 12453 transitions. Second operand 7 states. [2018-12-09 19:18:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:21,902 INFO L93 Difference]: Finished difference Result 5412 states and 13965 transitions. [2018-12-09 19:18:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:18:21,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-09 19:18:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:21,907 INFO L225 Difference]: With dead ends: 5412 [2018-12-09 19:18:21,907 INFO L226 Difference]: Without dead ends: 5412 [2018-12-09 19:18:21,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2018-12-09 19:18:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 4833. [2018-12-09 19:18:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2018-12-09 19:18:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 12587 transitions. [2018-12-09 19:18:21,955 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 12587 transitions. Word has length 107 [2018-12-09 19:18:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:21,955 INFO L480 AbstractCegarLoop]: Abstraction has 4833 states and 12587 transitions. [2018-12-09 19:18:21,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 12587 transitions. [2018-12-09 19:18:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:21,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:21,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:21,959 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:21,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash -994130960, now seen corresponding path program 2 times [2018-12-09 19:18:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:21,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:22,018 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 19:18:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:22,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:22,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:22,019 INFO L87 Difference]: Start difference. First operand 4833 states and 12587 transitions. Second operand 5 states. [2018-12-09 19:18:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:22,173 INFO L93 Difference]: Finished difference Result 5266 states and 13553 transitions. [2018-12-09 19:18:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:18:22,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-09 19:18:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:22,177 INFO L225 Difference]: With dead ends: 5266 [2018-12-09 19:18:22,177 INFO L226 Difference]: Without dead ends: 5266 [2018-12-09 19:18:22,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 19:18:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2018-12-09 19:18:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 4848. [2018-12-09 19:18:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4848 states. [2018-12-09 19:18:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 12618 transitions. [2018-12-09 19:18:22,211 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 12618 transitions. Word has length 107 [2018-12-09 19:18:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:22,212 INFO L480 AbstractCegarLoop]: Abstraction has 4848 states and 12618 transitions. [2018-12-09 19:18:22,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 12618 transitions. [2018-12-09 19:18:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:22,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:22,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:22,216 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:22,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 169647408, now seen corresponding path program 3 times [2018-12-09 19:18:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:22,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:18:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:22,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:22,272 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 19:18:22,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:22,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:22,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:22,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:22,273 INFO L87 Difference]: Start difference. First operand 4848 states and 12618 transitions. Second operand 4 states. [2018-12-09 19:18:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:22,396 INFO L93 Difference]: Finished difference Result 5372 states and 13833 transitions. [2018-12-09 19:18:22,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:18:22,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 19:18:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:22,400 INFO L225 Difference]: With dead ends: 5372 [2018-12-09 19:18:22,400 INFO L226 Difference]: Without dead ends: 5344 [2018-12-09 19:18:22,400 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 19:18:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-12-09 19:18:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5307. [2018-12-09 19:18:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5307 states. [2018-12-09 19:18:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 13709 transitions. [2018-12-09 19:18:22,436 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 13709 transitions. Word has length 107 [2018-12-09 19:18:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:22,436 INFO L480 AbstractCegarLoop]: Abstraction has 5307 states and 13709 transitions. [2018-12-09 19:18:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 13709 transitions. [2018-12-09 19:18:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:22,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:22,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:22,441 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:22,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1139228431, now seen corresponding path program 1 times [2018-12-09 19:18:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:22,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:18:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:22,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:22,471 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 19:18:22,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:22,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:18:22,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:22,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:18:22,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:18:22,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:18:22,472 INFO L87 Difference]: Start difference. First operand 5307 states and 13709 transitions. Second operand 3 states. [2018-12-09 19:18:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:22,619 INFO L93 Difference]: Finished difference Result 6660 states and 16872 transitions. [2018-12-09 19:18:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:18:22,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-09 19:18:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:22,626 INFO L225 Difference]: With dead ends: 6660 [2018-12-09 19:18:22,626 INFO L226 Difference]: Without dead ends: 6660 [2018-12-09 19:18:22,626 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 19:18:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6660 states. [2018-12-09 19:18:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6660 to 6335. [2018-12-09 19:18:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2018-12-09 19:18:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 16151 transitions. [2018-12-09 19:18:22,680 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 16151 transitions. Word has length 107 [2018-12-09 19:18:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:22,680 INFO L480 AbstractCegarLoop]: Abstraction has 6335 states and 16151 transitions. [2018-12-09 19:18:22,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:18:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 16151 transitions. [2018-12-09 19:18:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:22,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:22,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:18:22,685 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:22,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -935542593, now seen corresponding path program 2 times [2018-12-09 19:18:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:22,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:22,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:22,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:22,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 19:18:22,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:22,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:22,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:22,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:22,753 INFO L87 Difference]: Start difference. First operand 6335 states and 16151 transitions. Second operand 5 states. [2018-12-09 19:18:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:22,931 INFO L93 Difference]: Finished difference Result 7170 states and 18061 transitions. [2018-12-09 19:18:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:18:22,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-09 19:18:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:22,937 INFO L225 Difference]: With dead ends: 7170 [2018-12-09 19:18:22,937 INFO L226 Difference]: Without dead ends: 7142 [2018-12-09 19:18:22,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:18:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7142 states. [2018-12-09 19:18:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7142 to 6721. [2018-12-09 19:18:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6721 states. [2018-12-09 19:18:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 17010 transitions. [2018-12-09 19:18:22,994 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 17010 transitions. Word has length 107 [2018-12-09 19:18:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:22,994 INFO L480 AbstractCegarLoop]: Abstraction has 6721 states and 17010 transitions. [2018-12-09 19:18:22,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 17010 transitions. [2018-12-09 19:18:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:23,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:23,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:23,001 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:23,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2027707944, now seen corresponding path program 1 times [2018-12-09 19:18:23,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:18:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:23,024 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 19:18:23,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:23,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:23,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:23,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:23,025 INFO L87 Difference]: Start difference. First operand 6721 states and 17010 transitions. Second operand 4 states. [2018-12-09 19:18:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:23,211 INFO L93 Difference]: Finished difference Result 9881 states and 24422 transitions. [2018-12-09 19:18:23,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:18:23,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 19:18:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:23,218 INFO L225 Difference]: With dead ends: 9881 [2018-12-09 19:18:23,218 INFO L226 Difference]: Without dead ends: 9795 [2018-12-09 19:18:23,218 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 19:18:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2018-12-09 19:18:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 7387. [2018-12-09 19:18:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7387 states. [2018-12-09 19:18:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7387 states to 7387 states and 18672 transitions. [2018-12-09 19:18:23,282 INFO L78 Accepts]: Start accepts. Automaton has 7387 states and 18672 transitions. Word has length 107 [2018-12-09 19:18:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:23,283 INFO L480 AbstractCegarLoop]: Abstraction has 7387 states and 18672 transitions. [2018-12-09 19:18:23,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7387 states and 18672 transitions. [2018-12-09 19:18:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:18:23,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:23,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:23,289 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:23,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:23,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1393280754, now seen corresponding path program 2 times [2018-12-09 19:18:23,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:23,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:23,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:23,325 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 19:18:23,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:18:23,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:18:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:18:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:23,326 INFO L87 Difference]: Start difference. First operand 7387 states and 18672 transitions. Second operand 4 states. [2018-12-09 19:18:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:23,530 INFO L93 Difference]: Finished difference Result 8131 states and 20374 transitions. [2018-12-09 19:18:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:18:23,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 19:18:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:23,536 INFO L225 Difference]: With dead ends: 8131 [2018-12-09 19:18:23,536 INFO L226 Difference]: Without dead ends: 8131 [2018-12-09 19:18:23,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:18:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8131 states. [2018-12-09 19:18:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8131 to 7195. [2018-12-09 19:18:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2018-12-09 19:18:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 18235 transitions. [2018-12-09 19:18:23,594 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 18235 transitions. Word has length 107 [2018-12-09 19:18:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:23,594 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 18235 transitions. [2018-12-09 19:18:23,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:18:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 18235 transitions. [2018-12-09 19:18:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:23,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:23,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:23,599 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:23,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1194835832, now seen corresponding path program 1 times [2018-12-09 19:18:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:23,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:18:23,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:23,706 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 19:18:23,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:23,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:23,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:23,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:23,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:23,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:23,708 INFO L87 Difference]: Start difference. First operand 7195 states and 18235 transitions. Second operand 7 states. [2018-12-09 19:18:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:23,873 INFO L93 Difference]: Finished difference Result 9876 states and 24316 transitions. [2018-12-09 19:18:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:18:23,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 19:18:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:23,880 INFO L225 Difference]: With dead ends: 9876 [2018-12-09 19:18:23,880 INFO L226 Difference]: Without dead ends: 9814 [2018-12-09 19:18:23,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:18:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2018-12-09 19:18:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 8031. [2018-12-09 19:18:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8031 states. [2018-12-09 19:18:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 20139 transitions. [2018-12-09 19:18:23,947 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 20139 transitions. Word has length 109 [2018-12-09 19:18:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:23,948 INFO L480 AbstractCegarLoop]: Abstraction has 8031 states and 20139 transitions. [2018-12-09 19:18:23,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 20139 transitions. [2018-12-09 19:18:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:23,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:23,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:23,954 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:23,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash -319966379, now seen corresponding path program 1 times [2018-12-09 19:18:23,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:23,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:24,016 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 19:18:24,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:24,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:18:24,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:24,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:18:24,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:18:24,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:18:24,017 INFO L87 Difference]: Start difference. First operand 8031 states and 20139 transitions. Second operand 6 states. [2018-12-09 19:18:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:24,276 INFO L93 Difference]: Finished difference Result 10462 states and 26045 transitions. [2018-12-09 19:18:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:18:24,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 19:18:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:24,286 INFO L225 Difference]: With dead ends: 10462 [2018-12-09 19:18:24,286 INFO L226 Difference]: Without dead ends: 10430 [2018-12-09 19:18:24,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:18:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10430 states. [2018-12-09 19:18:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10430 to 8703. [2018-12-09 19:18:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8703 states. [2018-12-09 19:18:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 21915 transitions. [2018-12-09 19:18:24,359 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 21915 transitions. Word has length 109 [2018-12-09 19:18:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:24,360 INFO L480 AbstractCegarLoop]: Abstraction has 8703 states and 21915 transitions. [2018-12-09 19:18:24,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:18:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 21915 transitions. [2018-12-09 19:18:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:24,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:24,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:18:24,366 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:24,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 641647638, now seen corresponding path program 1 times [2018-12-09 19:18:24,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:24,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:24,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:24,423 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 19:18:24,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:24,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:24,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:24,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:24,424 INFO L87 Difference]: Start difference. First operand 8703 states and 21915 transitions. Second operand 7 states. [2018-12-09 19:18:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:24,786 INFO L93 Difference]: Finished difference Result 10651 states and 25915 transitions. [2018-12-09 19:18:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:18:24,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 19:18:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:24,794 INFO L225 Difference]: With dead ends: 10651 [2018-12-09 19:18:24,794 INFO L226 Difference]: Without dead ends: 10600 [2018-12-09 19:18:24,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:18:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2018-12-09 19:18:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 7480. [2018-12-09 19:18:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2018-12-09 19:18:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 18586 transitions. [2018-12-09 19:18:24,860 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 18586 transitions. Word has length 109 [2018-12-09 19:18:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:24,861 INFO L480 AbstractCegarLoop]: Abstraction has 7480 states and 18586 transitions. [2018-12-09 19:18:24,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 18586 transitions. [2018-12-09 19:18:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:24,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:24,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, 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 19:18:24,866 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:24,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash 963728536, now seen corresponding path program 1 times [2018-12-09 19:18:24,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:24,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:24,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:24,950 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 19:18:24,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:24,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:18:24,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:24,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:18:24,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:18:24,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:18:24,951 INFO L87 Difference]: Start difference. First operand 7480 states and 18586 transitions. Second operand 6 states. [2018-12-09 19:18:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:25,201 INFO L93 Difference]: Finished difference Result 7479 states and 18467 transitions. [2018-12-09 19:18:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:18:25,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 19:18:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:25,207 INFO L225 Difference]: With dead ends: 7479 [2018-12-09 19:18:25,208 INFO L226 Difference]: Without dead ends: 7479 [2018-12-09 19:18:25,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2018-12-09 19:18:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 6181. [2018-12-09 19:18:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6181 states. [2018-12-09 19:18:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 15306 transitions. [2018-12-09 19:18:25,259 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 15306 transitions. Word has length 109 [2018-12-09 19:18:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:25,259 INFO L480 AbstractCegarLoop]: Abstraction has 6181 states and 15306 transitions. [2018-12-09 19:18:25,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:18:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 15306 transitions. [2018-12-09 19:18:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:25,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:25,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:25,264 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:25,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1959966231, now seen corresponding path program 1 times [2018-12-09 19:18:25,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:25,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:25,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:25,334 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 19:18:25,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:25,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:25,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:25,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:25,335 INFO L87 Difference]: Start difference. First operand 6181 states and 15306 transitions. Second operand 7 states. [2018-12-09 19:18:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:25,657 INFO L93 Difference]: Finished difference Result 8318 states and 20436 transitions. [2018-12-09 19:18:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:18:25,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 19:18:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:25,663 INFO L225 Difference]: With dead ends: 8318 [2018-12-09 19:18:25,664 INFO L226 Difference]: Without dead ends: 8286 [2018-12-09 19:18:25,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:18:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2018-12-09 19:18:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 6784. [2018-12-09 19:18:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6784 states. [2018-12-09 19:18:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6784 states to 6784 states and 16649 transitions. [2018-12-09 19:18:25,724 INFO L78 Accepts]: Start accepts. Automaton has 6784 states and 16649 transitions. Word has length 109 [2018-12-09 19:18:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:25,724 INFO L480 AbstractCegarLoop]: Abstraction has 6784 states and 16649 transitions. [2018-12-09 19:18:25,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6784 states and 16649 transitions. [2018-12-09 19:18:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:25,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:25,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:18:25,730 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:25,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash -128622567, now seen corresponding path program 1 times [2018-12-09 19:18:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:25,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:25,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:25,847 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 19:18:25,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:25,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:25,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:25,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:25,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:25,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:25,848 INFO L87 Difference]: Start difference. First operand 6784 states and 16649 transitions. Second operand 7 states. [2018-12-09 19:18:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:25,953 INFO L93 Difference]: Finished difference Result 10147 states and 25466 transitions. [2018-12-09 19:18:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:18:25,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 19:18:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:25,961 INFO L225 Difference]: With dead ends: 10147 [2018-12-09 19:18:25,961 INFO L226 Difference]: Without dead ends: 10147 [2018-12-09 19:18:25,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:18:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10147 states. [2018-12-09 19:18:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10147 to 6985. [2018-12-09 19:18:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6985 states. [2018-12-09 19:18:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 17083 transitions. [2018-12-09 19:18:26,033 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 17083 transitions. Word has length 109 [2018-12-09 19:18:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:26,033 INFO L480 AbstractCegarLoop]: Abstraction has 6985 states and 17083 transitions. [2018-12-09 19:18:26,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 17083 transitions. [2018-12-09 19:18:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:26,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:18:26,039 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:26,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash 753549146, now seen corresponding path program 1 times [2018-12-09 19:18:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:26,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:26,114 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 19:18:26,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:26,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:18:26,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:26,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:18:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:18:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:18:26,114 INFO L87 Difference]: Start difference. First operand 6985 states and 17083 transitions. Second operand 8 states. [2018-12-09 19:18:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:26,512 INFO L93 Difference]: Finished difference Result 11565 states and 28729 transitions. [2018-12-09 19:18:26,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 19:18:26,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-12-09 19:18:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:26,520 INFO L225 Difference]: With dead ends: 11565 [2018-12-09 19:18:26,521 INFO L226 Difference]: Without dead ends: 11545 [2018-12-09 19:18:26,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:18:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11545 states. [2018-12-09 19:18:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11545 to 7551. [2018-12-09 19:18:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7551 states. [2018-12-09 19:18:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7551 states to 7551 states and 18371 transitions. [2018-12-09 19:18:26,593 INFO L78 Accepts]: Start accepts. Automaton has 7551 states and 18371 transitions. Word has length 109 [2018-12-09 19:18:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:26,593 INFO L480 AbstractCegarLoop]: Abstraction has 7551 states and 18371 transitions. [2018-12-09 19:18:26,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:18:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7551 states and 18371 transitions. [2018-12-09 19:18:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 19:18:26,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:26,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:26,600 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:26,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -161449574, now seen corresponding path program 1 times [2018-12-09 19:18:26,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:26,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:26,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:26,662 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 19:18:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:26,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:18:26,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:18:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:18:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:18:26,663 INFO L87 Difference]: Start difference. First operand 7551 states and 18371 transitions. Second operand 6 states. [2018-12-09 19:18:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:26,792 INFO L93 Difference]: Finished difference Result 7295 states and 17459 transitions. [2018-12-09 19:18:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:18:26,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 19:18:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:26,797 INFO L225 Difference]: With dead ends: 7295 [2018-12-09 19:18:26,797 INFO L226 Difference]: Without dead ends: 7295 [2018-12-09 19:18:26,797 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 19:18:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2018-12-09 19:18:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 5471. [2018-12-09 19:18:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-12-09 19:18:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 13234 transitions. [2018-12-09 19:18:26,842 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 13234 transitions. Word has length 109 [2018-12-09 19:18:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:26,842 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 13234 transitions. [2018-12-09 19:18:26,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:18:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 13234 transitions. [2018-12-09 19:18:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:18:26,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:26,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:26,847 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:26,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:26,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1660775284, now seen corresponding path program 1 times [2018-12-09 19:18:26,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:26,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:26,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:26,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:26,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:26,902 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 19:18:26,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:26,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:26,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:26,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:26,903 INFO L87 Difference]: Start difference. First operand 5471 states and 13234 transitions. Second operand 7 states. [2018-12-09 19:18:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:27,353 INFO L93 Difference]: Finished difference Result 10438 states and 24182 transitions. [2018-12-09 19:18:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:18:27,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 19:18:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:27,360 INFO L225 Difference]: With dead ends: 10438 [2018-12-09 19:18:27,360 INFO L226 Difference]: Without dead ends: 10406 [2018-12-09 19:18:27,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:18:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10406 states. [2018-12-09 19:18:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10406 to 7283. [2018-12-09 19:18:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2018-12-09 19:18:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 17387 transitions. [2018-12-09 19:18:27,425 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 17387 transitions. Word has length 111 [2018-12-09 19:18:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:27,425 INFO L480 AbstractCegarLoop]: Abstraction has 7283 states and 17387 transitions. [2018-12-09 19:18:27,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 17387 transitions. [2018-12-09 19:18:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:18:27,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:27,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:27,431 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:27,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash -416010803, now seen corresponding path program 1 times [2018-12-09 19:18:27,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:27,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:27,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:27,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:27,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:27,492 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 19:18:27,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:27,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:27,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:27,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:27,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:27,493 INFO L87 Difference]: Start difference. First operand 7283 states and 17387 transitions. Second operand 7 states. [2018-12-09 19:18:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:27,924 INFO L93 Difference]: Finished difference Result 9949 states and 23149 transitions. [2018-12-09 19:18:27,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:18:27,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 19:18:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:27,931 INFO L225 Difference]: With dead ends: 9949 [2018-12-09 19:18:27,931 INFO L226 Difference]: Without dead ends: 9949 [2018-12-09 19:18:27,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:18:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9949 states. [2018-12-09 19:18:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9949 to 7648. [2018-12-09 19:18:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7648 states. [2018-12-09 19:18:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7648 states to 7648 states and 18179 transitions. [2018-12-09 19:18:27,998 INFO L78 Accepts]: Start accepts. Automaton has 7648 states and 18179 transitions. Word has length 111 [2018-12-09 19:18:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:27,998 INFO L480 AbstractCegarLoop]: Abstraction has 7648 states and 18179 transitions. [2018-12-09 19:18:27,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 7648 states and 18179 transitions. [2018-12-09 19:18:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:18:28,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:28,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:28,004 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:28,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1331009523, now seen corresponding path program 1 times [2018-12-09 19:18:28,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:28,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:28,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:18:28,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:28,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:28,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:28,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:28,071 INFO L87 Difference]: Start difference. First operand 7648 states and 18179 transitions. Second operand 5 states. [2018-12-09 19:18:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:28,103 INFO L93 Difference]: Finished difference Result 9393 states and 22412 transitions. [2018-12-09 19:18:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:18:28,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 19:18:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:28,110 INFO L225 Difference]: With dead ends: 9393 [2018-12-09 19:18:28,110 INFO L226 Difference]: Without dead ends: 9393 [2018-12-09 19:18:28,110 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 19:18:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9393 states. [2018-12-09 19:18:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9393 to 6806. [2018-12-09 19:18:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6806 states. [2018-12-09 19:18:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6806 states to 6806 states and 15942 transitions. [2018-12-09 19:18:28,171 INFO L78 Accepts]: Start accepts. Automaton has 6806 states and 15942 transitions. Word has length 111 [2018-12-09 19:18:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:28,171 INFO L480 AbstractCegarLoop]: Abstraction has 6806 states and 15942 transitions. [2018-12-09 19:18:28,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6806 states and 15942 transitions. [2018-12-09 19:18:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:18:28,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:28,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:28,176 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:28,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 717179790, now seen corresponding path program 1 times [2018-12-09 19:18:28,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:28,245 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 19:18:28,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:28,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:18:28,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:28,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:18:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:18:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:28,246 INFO L87 Difference]: Start difference. First operand 6806 states and 15942 transitions. Second operand 7 states. [2018-12-09 19:18:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:28,430 INFO L93 Difference]: Finished difference Result 7874 states and 18109 transitions. [2018-12-09 19:18:28,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:18:28,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 19:18:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:28,436 INFO L225 Difference]: With dead ends: 7874 [2018-12-09 19:18:28,436 INFO L226 Difference]: Without dead ends: 7874 [2018-12-09 19:18:28,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:18:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7874 states. [2018-12-09 19:18:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7874 to 6878. [2018-12-09 19:18:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6878 states. [2018-12-09 19:18:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6878 states to 6878 states and 16082 transitions. [2018-12-09 19:18:28,488 INFO L78 Accepts]: Start accepts. Automaton has 6878 states and 16082 transitions. Word has length 111 [2018-12-09 19:18:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:28,488 INFO L480 AbstractCegarLoop]: Abstraction has 6878 states and 16082 transitions. [2018-12-09 19:18:28,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:18:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6878 states and 16082 transitions. [2018-12-09 19:18:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:18:28,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:28,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:28,493 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:28,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -197818930, now seen corresponding path program 1 times [2018-12-09 19:18:28,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:28,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:28,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:28,538 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 19:18:28,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:28,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:28,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:28,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:28,539 INFO L87 Difference]: Start difference. First operand 6878 states and 16082 transitions. Second operand 5 states. [2018-12-09 19:18:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:28,657 INFO L93 Difference]: Finished difference Result 7230 states and 16946 transitions. [2018-12-09 19:18:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:18:28,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 19:18:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:28,662 INFO L225 Difference]: With dead ends: 7230 [2018-12-09 19:18:28,662 INFO L226 Difference]: Without dead ends: 7198 [2018-12-09 19:18:28,662 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 19:18:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2018-12-09 19:18:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 6092. [2018-12-09 19:18:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6092 states. [2018-12-09 19:18:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 14243 transitions. [2018-12-09 19:18:28,708 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 14243 transitions. Word has length 111 [2018-12-09 19:18:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:28,708 INFO L480 AbstractCegarLoop]: Abstraction has 6092 states and 14243 transitions. [2018-12-09 19:18:28,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 14243 transitions. [2018-12-09 19:18:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:18:28,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:28,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:28,712 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:28,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1046945551, now seen corresponding path program 1 times [2018-12-09 19:18:28,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:28,746 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 19:18:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:18:28,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:28,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:18:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:18:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:18:28,747 INFO L87 Difference]: Start difference. First operand 6092 states and 14243 transitions. Second operand 5 states. [2018-12-09 19:18:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:28,883 INFO L93 Difference]: Finished difference Result 7438 states and 17126 transitions. [2018-12-09 19:18:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:18:28,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 19:18:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:28,887 INFO L225 Difference]: With dead ends: 7438 [2018-12-09 19:18:28,888 INFO L226 Difference]: Without dead ends: 7438 [2018-12-09 19:18:28,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:18:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7438 states. [2018-12-09 19:18:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7438 to 5683. [2018-12-09 19:18:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5683 states. [2018-12-09 19:18:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5683 states to 5683 states and 13280 transitions. [2018-12-09 19:18:28,931 INFO L78 Accepts]: Start accepts. Automaton has 5683 states and 13280 transitions. Word has length 111 [2018-12-09 19:18:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:28,931 INFO L480 AbstractCegarLoop]: Abstraction has 5683 states and 13280 transitions. [2018-12-09 19:18:28,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:18:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5683 states and 13280 transitions. [2018-12-09 19:18:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 19:18:28,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:28,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:18:28,934 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:28,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -823375308, now seen corresponding path program 1 times [2018-12-09 19:18:28,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:28,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:29,027 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 19:18:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:18:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:18:29,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:18:29,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:18:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:18:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:18:29,029 INFO L87 Difference]: Start difference. First operand 5683 states and 13280 transitions. Second operand 10 states. [2018-12-09 19:18:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:29,239 INFO L93 Difference]: Finished difference Result 8512 states and 20421 transitions. [2018-12-09 19:18:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:18:29,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 19:18:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:29,241 INFO L225 Difference]: With dead ends: 8512 [2018-12-09 19:18:29,241 INFO L226 Difference]: Without dead ends: 2631 [2018-12-09 19:18:29,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:18:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2018-12-09 19:18:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2018-12-09 19:18:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-12-09 19:18:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 6486 transitions. [2018-12-09 19:18:29,261 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 6486 transitions. Word has length 113 [2018-12-09 19:18:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:29,261 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 6486 transitions. [2018-12-09 19:18:29,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:18:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 6486 transitions. [2018-12-09 19:18:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 19:18:29,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:29,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:18:29,264 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:29,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1992642750, now seen corresponding path program 2 times [2018-12-09 19:18:29,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:18:29,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:29,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:29,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:18:29,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:18:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:18:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:18:29,307 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:18:29,372 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:18:29,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:18:29 BasicIcfg [2018-12-09 19:18:29,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:18:29,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:18:29,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:18:29,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:18:29,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:18:01" (3/4) ... [2018-12-09 19:18:29,376 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:18:29,454 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4479e412-2e8c-43e8-b189-b9b5e9079624/bin-2019/utaipan/witness.graphml [2018-12-09 19:18:29,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:18:29,455 INFO L168 Benchmark]: Toolchain (without parser) took 28818.00 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 951.3 MB in the beginning and 1.8 GB in the end (delta: -841.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-09 19:18:29,456 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:18:29,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:18:29,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:18:29,456 INFO L168 Benchmark]: Boogie Preprocessor took 24.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:18:29,457 INFO L168 Benchmark]: RCFGBuilder took 431.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.3 MB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:18:29,457 INFO L168 Benchmark]: TraceAbstraction took 27910.71 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 981.3 MB in the beginning and 1.8 GB in the end (delta: -856.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-09 19:18:29,457 INFO L168 Benchmark]: Witness Printer took 80.19 ms. Allocated memory is still 4.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:18:29,458 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 431.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.3 MB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27910.71 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 981.3 MB in the beginning and 1.8 GB in the end (delta: -856.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 80.19 ms. Allocated memory is still 4.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L773] -1 pthread_t t1721; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L774] FCALL, FORK -1 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L775] -1 pthread_t t1722; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L776] FCALL, FORK -1 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L721] 0 y$w_buff1 = y$w_buff0 [L722] 0 y$w_buff0 = 2 [L723] 0 y$w_buff1_used = y$w_buff0_used [L724] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L727] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L728] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L729] 0 y$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 y$flush_delayed = weak$$choice2 [L735] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 y = y$flush_delayed ? y$mem_tmp : y [L745] 0 y$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L701] 1 x = 1 [L704] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L708] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 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) [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 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 [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 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 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -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) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -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 [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -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 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 y$flush_delayed = weak$$choice2 [L792] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L794] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L795] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L796] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L798] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L799] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L800] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y = y$flush_delayed ? y$mem_tmp : y [L802] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 27.8s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10446 SDtfs, 10382 SDslu, 22391 SDs, 0 SdLazy, 9003 SolverSat, 518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 76 SyntacticMatches, 28 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred in iteration=2, 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: 10.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 204208 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2992 NumberOfCodeBlocks, 2992 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2849 ConstructedInterpolants, 0 QuantifiedInterpolants, 656109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...