./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.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_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/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 2704334a5f5c65f6107547c60b5bde5e46cdf374 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:57:39,069 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:57:39,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:57:39,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:57:39,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:57:39,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:57:39,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:57:39,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:57:39,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:57:39,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:57:39,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:57:39,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:57:39,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:57:39,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:57:39,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:57:39,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:57:39,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:57:39,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:57:39,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:57:39,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:57:39,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:57:39,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:57:39,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:57:39,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:57:39,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:57:39,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:57:39,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:57:39,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:57:39,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:57:39,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:57:39,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:57:39,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:57:39,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:57:39,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:57:39,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:57:39,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:57:39,099 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 14:57:39,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:57:39,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:57:39,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:57:39,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:57:39,110 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 14:57:39,111 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 14:57:39,111 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 14:57:39,111 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 14:57:39,111 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 14:57:39,111 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 14:57:39,111 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 14:57:39,111 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 14:57:39,112 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 14:57:39,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:57:39,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:57:39,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:57:39,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:57:39,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:57:39,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 14:57:39,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:57:39,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 14:57:39,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:57:39,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 14:57:39,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:57:39,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 14:57:39,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:57:39,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 14:57:39,115 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 14:57:39,115 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_782a859b-fc20-4c3d-afd2-87e5fcbef42f/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 -> 2704334a5f5c65f6107547c60b5bde5e46cdf374 [2018-12-09 14:57:39,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:57:39,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:57:39,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:57:39,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:57:39,146 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:57:39,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2018-12-09 14:57:39,180 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/data/7fb6c24d7/e8cd75fcd89e41c9b40252fc73166f21/FLAG213ebdcca [2018-12-09 14:57:39,602 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:57:39,602 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2018-12-09 14:57:39,610 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/data/7fb6c24d7/e8cd75fcd89e41c9b40252fc73166f21/FLAG213ebdcca [2018-12-09 14:57:39,933 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/data/7fb6c24d7/e8cd75fcd89e41c9b40252fc73166f21 [2018-12-09 14:57:39,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:57:39,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 14:57:39,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:57:39,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:57:39,947 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:57:39,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:57:39" (1/1) ... [2018-12-09 14:57:39,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c0526c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:39, skipping insertion in model container [2018-12-09 14:57:39,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:57:39" (1/1) ... [2018-12-09 14:57:39,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:57:39,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:57:40,151 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:57:40,159 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:57:40,226 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:57:40,255 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:57:40,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40 WrapperNode [2018-12-09 14:57:40,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:57:40,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 14:57:40,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 14:57:40,256 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 14:57:40,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 14:57:40,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:57:40,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:57:40,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:57:40,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... [2018-12-09 14:57:40,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:57:40,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:57:40,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:57:40,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:57:40,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/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 14:57:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 14:57:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 14:57:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 14:57:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 14:57:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 14:57:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 14:57:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 14:57:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 14:57:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 14:57:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:57:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:57:40,344 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 14:57:40,654 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:57:40,654 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 14:57:40,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:57:40 BoogieIcfgContainer [2018-12-09 14:57:40,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:57:40,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:57:40,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:57:40,659 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:57:40,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:57:39" (1/3) ... [2018-12-09 14:57:40,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:57:40, skipping insertion in model container [2018-12-09 14:57:40,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:57:40" (2/3) ... [2018-12-09 14:57:40,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:57:40, skipping insertion in model container [2018-12-09 14:57:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:57:40" (3/3) ... [2018-12-09 14:57:40,661 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt_false-unreach-call.i [2018-12-09 14:57:40,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,692 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,692 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,692 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 14:57:40,701 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 14:57:40,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:57:40,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 14:57:40,718 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 14:57:40,735 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:57:40,735 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 14:57:40,735 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:57:40,735 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:57:40,735 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:57:40,735 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:57:40,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:57:40,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:57:40,744 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-09 14:57:41,747 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2018-12-09 14:57:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2018-12-09 14:57:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 14:57:41,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:41,756 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] [2018-12-09 14:57:41,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:41,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2018-12-09 14:57:41,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:41,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:41,923 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 14:57:41,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:41,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:57:41,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:41,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:57:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:57:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:57:41,937 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2018-12-09 14:57:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:42,322 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2018-12-09 14:57:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 14:57:42,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 14:57:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:42,485 INFO L225 Difference]: With dead ends: 45386 [2018-12-09 14:57:42,486 INFO L226 Difference]: Without dead ends: 40626 [2018-12-09 14:57:42,487 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 14:57:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2018-12-09 14:57:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2018-12-09 14:57:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2018-12-09 14:57:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2018-12-09 14:57:43,164 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2018-12-09 14:57:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:43,165 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2018-12-09 14:57:43,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:57:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2018-12-09 14:57:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 14:57:43,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:43,170 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] [2018-12-09 14:57:43,170 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:43,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 435483284, now seen corresponding path program 1 times [2018-12-09 14:57:43,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:43,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:43,251 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 14:57:43,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:43,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:43,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:43,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:43,253 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2018-12-09 14:57:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:43,890 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2018-12-09 14:57:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:57:43,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 14:57:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:44,033 INFO L225 Difference]: With dead ends: 64828 [2018-12-09 14:57:44,033 INFO L226 Difference]: Without dead ends: 64668 [2018-12-09 14:57:44,034 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 14:57:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2018-12-09 14:57:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2018-12-09 14:57:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2018-12-09 14:57:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2018-12-09 14:57:44,796 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2018-12-09 14:57:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:44,796 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2018-12-09 14:57:44,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2018-12-09 14:57:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 14:57:44,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:44,798 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] [2018-12-09 14:57:44,799 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:44,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2018-12-09 14:57:44,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:44,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:44,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:44,834 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 14:57:44,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:44,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:57:44,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:44,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:57:44,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:57:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:57:44,835 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2018-12-09 14:57:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:44,873 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2018-12-09 14:57:44,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:57:44,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 14:57:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:44,888 INFO L225 Difference]: With dead ends: 12362 [2018-12-09 14:57:44,889 INFO L226 Difference]: Without dead ends: 11841 [2018-12-09 14:57:44,889 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 14:57:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2018-12-09 14:57:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2018-12-09 14:57:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2018-12-09 14:57:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2018-12-09 14:57:45,016 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2018-12-09 14:57:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:45,017 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2018-12-09 14:57:45,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:57:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2018-12-09 14:57:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 14:57:45,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:45,020 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] [2018-12-09 14:57:45,020 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:45,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1477280175, now seen corresponding path program 1 times [2018-12-09 14:57:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:45,077 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 14:57:45,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:45,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:57:45,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:45,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:57:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:57:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:57:45,079 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2018-12-09 14:57:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:45,225 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2018-12-09 14:57:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:57:45,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 14:57:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:45,246 INFO L225 Difference]: With dead ends: 17017 [2018-12-09 14:57:45,246 INFO L226 Difference]: Without dead ends: 17017 [2018-12-09 14:57:45,246 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 14:57:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2018-12-09 14:57:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2018-12-09 14:57:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2018-12-09 14:57:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2018-12-09 14:57:45,438 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2018-12-09 14:57:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:45,439 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2018-12-09 14:57:45,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:57:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2018-12-09 14:57:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 14:57:45,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:45,443 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] [2018-12-09 14:57:45,444 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:45,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:45,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1182034221, now seen corresponding path program 1 times [2018-12-09 14:57:45,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:45,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:45,493 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 14:57:45,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:45,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:45,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:45,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:45,494 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 5 states. [2018-12-09 14:57:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:45,520 INFO L93 Difference]: Finished difference Result 2521 states and 6735 transitions. [2018-12-09 14:57:45,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 14:57:45,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-09 14:57:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:45,523 INFO L225 Difference]: With dead ends: 2521 [2018-12-09 14:57:45,523 INFO L226 Difference]: Without dead ends: 2109 [2018-12-09 14:57:45,523 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 14:57:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2018-12-09 14:57:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2006. [2018-12-09 14:57:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2018-12-09 14:57:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 5338 transitions. [2018-12-09 14:57:45,542 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 5338 transitions. Word has length 56 [2018-12-09 14:57:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:45,542 INFO L480 AbstractCegarLoop]: Abstraction has 2006 states and 5338 transitions. [2018-12-09 14:57:45,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 5338 transitions. [2018-12-09 14:57:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 14:57:45,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:45,545 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] [2018-12-09 14:57:45,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:45,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 318545353, now seen corresponding path program 1 times [2018-12-09 14:57:45,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:45,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:45,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:45,579 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 14:57:45,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:45,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:57:45,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:45,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:57:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:57:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:57:45,580 INFO L87 Difference]: Start difference. First operand 2006 states and 5338 transitions. Second operand 3 states. [2018-12-09 14:57:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:45,664 INFO L93 Difference]: Finished difference Result 2090 states and 5527 transitions. [2018-12-09 14:57:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:57:45,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-09 14:57:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:45,666 INFO L225 Difference]: With dead ends: 2090 [2018-12-09 14:57:45,666 INFO L226 Difference]: Without dead ends: 2090 [2018-12-09 14:57:45,666 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 14:57:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-12-09 14:57:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2044. [2018-12-09 14:57:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-12-09 14:57:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 5424 transitions. [2018-12-09 14:57:45,685 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 5424 transitions. Word has length 89 [2018-12-09 14:57:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:45,685 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 5424 transitions. [2018-12-09 14:57:45,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:57:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 5424 transitions. [2018-12-09 14:57:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 14:57:45,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:45,689 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] [2018-12-09 14:57:45,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:45,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1894805112, now seen corresponding path program 1 times [2018-12-09 14:57:45,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:45,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:45,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:45,805 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 14:57:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:45,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:57:45,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:45,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:57:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:57:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:57:45,806 INFO L87 Difference]: Start difference. First operand 2044 states and 5424 transitions. Second operand 4 states. [2018-12-09 14:57:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:45,934 INFO L93 Difference]: Finished difference Result 3189 states and 8505 transitions. [2018-12-09 14:57:45,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 14:57:45,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-09 14:57:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:45,937 INFO L225 Difference]: With dead ends: 3189 [2018-12-09 14:57:45,937 INFO L226 Difference]: Without dead ends: 3189 [2018-12-09 14:57:45,938 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 14:57:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2018-12-09 14:57:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2084. [2018-12-09 14:57:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2018-12-09 14:57:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 5514 transitions. [2018-12-09 14:57:45,955 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 5514 transitions. Word has length 89 [2018-12-09 14:57:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:45,956 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 5514 transitions. [2018-12-09 14:57:45,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:57:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 5514 transitions. [2018-12-09 14:57:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 14:57:45,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:45,958 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] [2018-12-09 14:57:45,958 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:45,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1714371072, now seen corresponding path program 2 times [2018-12-09 14:57:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:45,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:45,999 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 14:57:45,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:46,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:46,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:46,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:46,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:46,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:46,000 INFO L87 Difference]: Start difference. First operand 2084 states and 5514 transitions. Second operand 5 states. [2018-12-09 14:57:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:46,120 INFO L93 Difference]: Finished difference Result 2972 states and 7652 transitions. [2018-12-09 14:57:46,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:57:46,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-09 14:57:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:46,122 INFO L225 Difference]: With dead ends: 2972 [2018-12-09 14:57:46,122 INFO L226 Difference]: Without dead ends: 2972 [2018-12-09 14:57:46,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:57:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-12-09 14:57:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2208. [2018-12-09 14:57:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2018-12-09 14:57:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 5829 transitions. [2018-12-09 14:57:46,140 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 5829 transitions. Word has length 89 [2018-12-09 14:57:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:46,140 INFO L480 AbstractCegarLoop]: Abstraction has 2208 states and 5829 transitions. [2018-12-09 14:57:46,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 5829 transitions. [2018-12-09 14:57:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 14:57:46,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:46,142 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] [2018-12-09 14:57:46,142 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1904549666, now seen corresponding path program 3 times [2018-12-09 14:57:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 14:57:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:46,195 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 14:57:46,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:57:46,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:46,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:57:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:57:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:46,196 INFO L87 Difference]: Start difference. First operand 2208 states and 5829 transitions. Second operand 7 states. [2018-12-09 14:57:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:46,483 INFO L93 Difference]: Finished difference Result 2942 states and 7549 transitions. [2018-12-09 14:57:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 14:57:46,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-09 14:57:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:46,486 INFO L225 Difference]: With dead ends: 2942 [2018-12-09 14:57:46,486 INFO L226 Difference]: Without dead ends: 2896 [2018-12-09 14:57:46,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 14:57:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2018-12-09 14:57:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2389. [2018-12-09 14:57:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2018-12-09 14:57:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 6245 transitions. [2018-12-09 14:57:46,505 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 6245 transitions. Word has length 89 [2018-12-09 14:57:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:46,505 INFO L480 AbstractCegarLoop]: Abstraction has 2389 states and 6245 transitions. [2018-12-09 14:57:46,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:57:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 6245 transitions. [2018-12-09 14:57:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 14:57:46,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:46,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:46,509 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:46,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:46,509 INFO L82 PathProgramCache]: Analyzing trace with hash 66389791, now seen corresponding path program 1 times [2018-12-09 14:57:46,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 14:57:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:46,559 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 14:57:46,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:46,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:46,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:46,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:46,560 INFO L87 Difference]: Start difference. First operand 2389 states and 6245 transitions. Second operand 5 states. [2018-12-09 14:57:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:46,681 INFO L93 Difference]: Finished difference Result 3274 states and 8297 transitions. [2018-12-09 14:57:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:57:46,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-09 14:57:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:46,684 INFO L225 Difference]: With dead ends: 3274 [2018-12-09 14:57:46,684 INFO L226 Difference]: Without dead ends: 3210 [2018-12-09 14:57:46,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 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 14:57:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2018-12-09 14:57:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2424. [2018-12-09 14:57:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2018-12-09 14:57:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 6308 transitions. [2018-12-09 14:57:46,703 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 6308 transitions. Word has length 89 [2018-12-09 14:57:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:46,703 INFO L480 AbstractCegarLoop]: Abstraction has 2424 states and 6308 transitions. [2018-12-09 14:57:46,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 6308 transitions. [2018-12-09 14:57:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:46,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:46,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:46,705 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:46,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1433627711, now seen corresponding path program 1 times [2018-12-09 14:57:46,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:46,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:46,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:46,742 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 14:57:46,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:46,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:46,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:46,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:46,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:46,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:46,743 INFO L87 Difference]: Start difference. First operand 2424 states and 6308 transitions. Second operand 5 states. [2018-12-09 14:57:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:46,914 INFO L93 Difference]: Finished difference Result 5336 states and 14263 transitions. [2018-12-09 14:57:46,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:57:46,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 14:57:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:46,918 INFO L225 Difference]: With dead ends: 5336 [2018-12-09 14:57:46,919 INFO L226 Difference]: Without dead ends: 5287 [2018-12-09 14:57:46,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2018-12-09 14:57:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 2195. [2018-12-09 14:57:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-12-09 14:57:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 5666 transitions. [2018-12-09 14:57:46,944 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 5666 transitions. Word has length 91 [2018-12-09 14:57:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:46,944 INFO L480 AbstractCegarLoop]: Abstraction has 2195 states and 5666 transitions. [2018-12-09 14:57:46,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 5666 transitions. [2018-12-09 14:57:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:46,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:46,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:46,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:46,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 510944128, now seen corresponding path program 1 times [2018-12-09 14:57:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:46,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:47,009 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 14:57:47,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:47,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:57:47,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:47,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:57:47,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:57:47,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:57:47,010 INFO L87 Difference]: Start difference. First operand 2195 states and 5666 transitions. Second operand 6 states. [2018-12-09 14:57:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:47,141 INFO L93 Difference]: Finished difference Result 2441 states and 6198 transitions. [2018-12-09 14:57:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 14:57:47,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 14:57:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:47,143 INFO L225 Difference]: With dead ends: 2441 [2018-12-09 14:57:47,143 INFO L226 Difference]: Without dead ends: 2441 [2018-12-09 14:57:47,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 14:57:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-12-09 14:57:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2086. [2018-12-09 14:57:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2018-12-09 14:57:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 5380 transitions. [2018-12-09 14:57:47,158 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 5380 transitions. Word has length 91 [2018-12-09 14:57:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:47,159 INFO L480 AbstractCegarLoop]: Abstraction has 2086 states and 5380 transitions. [2018-12-09 14:57:47,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:57:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 5380 transitions. [2018-12-09 14:57:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:47,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:47,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:47,160 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:47,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1275259263, now seen corresponding path program 1 times [2018-12-09 14:57:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:47,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:47,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:47,200 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 14:57:47,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:47,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:57:47,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:47,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 14:57:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 14:57:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 14:57:47,202 INFO L87 Difference]: Start difference. First operand 2086 states and 5380 transitions. Second operand 4 states. [2018-12-09 14:57:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:47,293 INFO L93 Difference]: Finished difference Result 2422 states and 6300 transitions. [2018-12-09 14:57:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 14:57:47,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 14:57:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:47,295 INFO L225 Difference]: With dead ends: 2422 [2018-12-09 14:57:47,295 INFO L226 Difference]: Without dead ends: 2422 [2018-12-09 14:57:47,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 14:57:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2018-12-09 14:57:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2390. [2018-12-09 14:57:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2018-12-09 14:57:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 6220 transitions. [2018-12-09 14:57:47,312 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 6220 transitions. Word has length 91 [2018-12-09 14:57:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:47,312 INFO L480 AbstractCegarLoop]: Abstraction has 2390 states and 6220 transitions. [2018-12-09 14:57:47,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 14:57:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 6220 transitions. [2018-12-09 14:57:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:47,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:47,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:47,315 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:47,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 942498690, now seen corresponding path program 1 times [2018-12-09 14:57:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:47,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:47,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:47,384 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 14:57:47,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:47,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:57:47,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:47,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:57:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:57:47,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:47,385 INFO L87 Difference]: Start difference. First operand 2390 states and 6220 transitions. Second operand 7 states. [2018-12-09 14:57:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:47,614 INFO L93 Difference]: Finished difference Result 3910 states and 9984 transitions. [2018-12-09 14:57:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 14:57:47,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 14:57:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:47,617 INFO L225 Difference]: With dead ends: 3910 [2018-12-09 14:57:47,617 INFO L226 Difference]: Without dead ends: 3878 [2018-12-09 14:57:47,617 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 14:57:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2018-12-09 14:57:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3254. [2018-12-09 14:57:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2018-12-09 14:57:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 8389 transitions. [2018-12-09 14:57:47,643 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 8389 transitions. Word has length 91 [2018-12-09 14:57:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:47,643 INFO L480 AbstractCegarLoop]: Abstraction has 3254 states and 8389 transitions. [2018-12-09 14:57:47,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:57:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 8389 transitions. [2018-12-09 14:57:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:47,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:47,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:47,645 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:47,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1904112707, now seen corresponding path program 1 times [2018-12-09 14:57:47,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:47,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:47,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:47,732 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 14:57:47,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:47,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:57:47,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:47,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:57:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:57:47,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:47,733 INFO L87 Difference]: Start difference. First operand 3254 states and 8389 transitions. Second operand 7 states. [2018-12-09 14:57:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:47,948 INFO L93 Difference]: Finished difference Result 4497 states and 11477 transitions. [2018-12-09 14:57:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 14:57:47,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 14:57:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:47,952 INFO L225 Difference]: With dead ends: 4497 [2018-12-09 14:57:47,952 INFO L226 Difference]: Without dead ends: 4497 [2018-12-09 14:57:47,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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 14:57:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2018-12-09 14:57:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 3718. [2018-12-09 14:57:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2018-12-09 14:57:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 9631 transitions. [2018-12-09 14:57:48,026 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 9631 transitions. Word has length 91 [2018-12-09 14:57:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:48,026 INFO L480 AbstractCegarLoop]: Abstraction has 3718 states and 9631 transitions. [2018-12-09 14:57:48,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:57:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 9631 transitions. [2018-12-09 14:57:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:48,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:48,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:48,029 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:48,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:48,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1146090108, now seen corresponding path program 1 times [2018-12-09 14:57:48,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:48,092 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 14:57:48,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:48,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:57:48,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:48,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:57:48,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:57:48,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:57:48,093 INFO L87 Difference]: Start difference. First operand 3718 states and 9631 transitions. Second operand 6 states. [2018-12-09 14:57:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:48,249 INFO L93 Difference]: Finished difference Result 4467 states and 11566 transitions. [2018-12-09 14:57:48,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 14:57:48,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 14:57:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:48,253 INFO L225 Difference]: With dead ends: 4467 [2018-12-09 14:57:48,253 INFO L226 Difference]: Without dead ends: 4467 [2018-12-09 14:57:48,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2018-12-09 14:57:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3597. [2018-12-09 14:57:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-09 14:57:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9312 transitions. [2018-12-09 14:57:48,280 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9312 transitions. Word has length 91 [2018-12-09 14:57:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9312 transitions. [2018-12-09 14:57:48,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:57:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9312 transitions. [2018-12-09 14:57:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:48,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:48,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:48,284 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:48,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash 682115181, now seen corresponding path program 1 times [2018-12-09 14:57:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:48,351 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 14:57:48,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:48,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:57:48,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:48,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:57:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:57:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:48,352 INFO L87 Difference]: Start difference. First operand 3597 states and 9312 transitions. Second operand 7 states. [2018-12-09 14:57:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:48,571 INFO L93 Difference]: Finished difference Result 3854 states and 9924 transitions. [2018-12-09 14:57:48,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:57:48,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 14:57:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:48,574 INFO L225 Difference]: With dead ends: 3854 [2018-12-09 14:57:48,574 INFO L226 Difference]: Without dead ends: 3854 [2018-12-09 14:57:48,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2018-12-09 14:57:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3595. [2018-12-09 14:57:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2018-12-09 14:57:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 9299 transitions. [2018-12-09 14:57:48,601 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 9299 transitions. Word has length 91 [2018-12-09 14:57:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:48,601 INFO L480 AbstractCegarLoop]: Abstraction has 3595 states and 9299 transitions. [2018-12-09 14:57:48,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:57:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 9299 transitions. [2018-12-09 14:57:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:48,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:48,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:48,604 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:48,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1587356682, now seen corresponding path program 1 times [2018-12-09 14:57:48,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:48,677 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 14:57:48,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 14:57:48,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:48,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:57:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:57:48,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:57:48,678 INFO L87 Difference]: Start difference. First operand 3595 states and 9299 transitions. Second operand 8 states. [2018-12-09 14:57:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:48,913 INFO L93 Difference]: Finished difference Result 4253 states and 10835 transitions. [2018-12-09 14:57:48,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 14:57:48,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-12-09 14:57:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:48,916 INFO L225 Difference]: With dead ends: 4253 [2018-12-09 14:57:48,916 INFO L226 Difference]: Without dead ends: 4221 [2018-12-09 14:57:48,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-09 14:57:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2018-12-09 14:57:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 3128. [2018-12-09 14:57:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2018-12-09 14:57:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 8019 transitions. [2018-12-09 14:57:48,941 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 8019 transitions. Word has length 91 [2018-12-09 14:57:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:48,941 INFO L480 AbstractCegarLoop]: Abstraction has 3128 states and 8019 transitions. [2018-12-09 14:57:48,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:57:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 8019 transitions. [2018-12-09 14:57:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:48,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:48,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:48,944 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:48,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:48,944 INFO L82 PathProgramCache]: Analyzing trace with hash -501232116, now seen corresponding path program 1 times [2018-12-09 14:57:48,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:48,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:48,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:48,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:49,003 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 14:57:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:49,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:49,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:49,004 INFO L87 Difference]: Start difference. First operand 3128 states and 8019 transitions. Second operand 5 states. [2018-12-09 14:57:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:49,028 INFO L93 Difference]: Finished difference Result 5011 states and 13104 transitions. [2018-12-09 14:57:49,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:57:49,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 14:57:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:49,032 INFO L225 Difference]: With dead ends: 5011 [2018-12-09 14:57:49,032 INFO L226 Difference]: Without dead ends: 5011 [2018-12-09 14:57:49,032 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 14:57:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2018-12-09 14:57:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 2856. [2018-12-09 14:57:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-12-09 14:57:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 7248 transitions. [2018-12-09 14:57:49,060 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 7248 transitions. Word has length 91 [2018-12-09 14:57:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:49,060 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 7248 transitions. [2018-12-09 14:57:49,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 7248 transitions. [2018-12-09 14:57:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 14:57:49,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:49,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:49,063 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:49,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash -20515700, now seen corresponding path program 1 times [2018-12-09 14:57:49,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:49,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:49,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:49,120 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 14:57:49,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:49,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:57:49,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:49,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:57:49,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:57:49,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:57:49,121 INFO L87 Difference]: Start difference. First operand 2856 states and 7248 transitions. Second operand 6 states. [2018-12-09 14:57:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:49,228 INFO L93 Difference]: Finished difference Result 2504 states and 6208 transitions. [2018-12-09 14:57:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:57:49,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 14:57:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:49,230 INFO L225 Difference]: With dead ends: 2504 [2018-12-09 14:57:49,230 INFO L226 Difference]: Without dead ends: 2504 [2018-12-09 14:57:49,230 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 14:57:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2018-12-09 14:57:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2025. [2018-12-09 14:57:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2018-12-09 14:57:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5113 transitions. [2018-12-09 14:57:49,245 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5113 transitions. Word has length 91 [2018-12-09 14:57:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:49,245 INFO L480 AbstractCegarLoop]: Abstraction has 2025 states and 5113 transitions. [2018-12-09 14:57:49,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:57:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5113 transitions. [2018-12-09 14:57:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 14:57:49,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:49,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:49,247 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:49,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2074225848, now seen corresponding path program 1 times [2018-12-09 14:57:49,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:49,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:49,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:49,301 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 14:57:49,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:49,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 14:57:49,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:49,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:57:49,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:57:49,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:57:49,302 INFO L87 Difference]: Start difference. First operand 2025 states and 5113 transitions. Second operand 8 states. [2018-12-09 14:57:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:49,561 INFO L93 Difference]: Finished difference Result 2916 states and 7221 transitions. [2018-12-09 14:57:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 14:57:49,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 14:57:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:49,563 INFO L225 Difference]: With dead ends: 2916 [2018-12-09 14:57:49,563 INFO L226 Difference]: Without dead ends: 2916 [2018-12-09 14:57:49,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-09 14:57:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2018-12-09 14:57:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2341. [2018-12-09 14:57:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2018-12-09 14:57:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5888 transitions. [2018-12-09 14:57:49,581 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5888 transitions. Word has length 93 [2018-12-09 14:57:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:49,581 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 5888 transitions. [2018-12-09 14:57:49,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:57:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5888 transitions. [2018-12-09 14:57:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 14:57:49,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:49,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:49,583 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:49,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -829461367, now seen corresponding path program 1 times [2018-12-09 14:57:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:49,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:49,652 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 14:57:49,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:49,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:57:49,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:49,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:57:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:57:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:57:49,653 INFO L87 Difference]: Start difference. First operand 2341 states and 5888 transitions. Second operand 6 states. [2018-12-09 14:57:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:49,727 INFO L93 Difference]: Finished difference Result 2470 states and 6124 transitions. [2018-12-09 14:57:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:57:49,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 14:57:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:49,729 INFO L225 Difference]: With dead ends: 2470 [2018-12-09 14:57:49,729 INFO L226 Difference]: Without dead ends: 2450 [2018-12-09 14:57:49,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:57:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2018-12-09 14:57:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2275. [2018-12-09 14:57:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2018-12-09 14:57:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 5753 transitions. [2018-12-09 14:57:49,745 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 5753 transitions. Word has length 93 [2018-12-09 14:57:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:49,745 INFO L480 AbstractCegarLoop]: Abstraction has 2275 states and 5753 transitions. [2018-12-09 14:57:49,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:57:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 5753 transitions. [2018-12-09 14:57:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 14:57:49,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:49,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:49,747 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:49,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1278158006, now seen corresponding path program 1 times [2018-12-09 14:57:49,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:49,797 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 14:57:49,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:49,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:57:49,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:49,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:57:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:57:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:57:49,798 INFO L87 Difference]: Start difference. First operand 2275 states and 5753 transitions. Second operand 6 states. [2018-12-09 14:57:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:49,891 INFO L93 Difference]: Finished difference Result 2065 states and 5170 transitions. [2018-12-09 14:57:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 14:57:49,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 14:57:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:49,894 INFO L225 Difference]: With dead ends: 2065 [2018-12-09 14:57:49,894 INFO L226 Difference]: Without dead ends: 2065 [2018-12-09 14:57:49,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 14:57:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2018-12-09 14:57:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1995. [2018-12-09 14:57:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-12-09 14:57:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 5037 transitions. [2018-12-09 14:57:49,915 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 5037 transitions. Word has length 93 [2018-12-09 14:57:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:49,915 INFO L480 AbstractCegarLoop]: Abstraction has 1995 states and 5037 transitions. [2018-12-09 14:57:49,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:57:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 5037 transitions. [2018-12-09 14:57:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 14:57:49,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:49,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:49,918 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:49,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash 849361226, now seen corresponding path program 1 times [2018-12-09 14:57:49,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:49,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:49,952 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 14:57:49,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:49,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:57:49,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:49,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:57:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:57:49,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:57:49,953 INFO L87 Difference]: Start difference. First operand 1995 states and 5037 transitions. Second operand 5 states. [2018-12-09 14:57:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:50,059 INFO L93 Difference]: Finished difference Result 2315 states and 5837 transitions. [2018-12-09 14:57:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:57:50,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 14:57:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:50,062 INFO L225 Difference]: With dead ends: 2315 [2018-12-09 14:57:50,062 INFO L226 Difference]: Without dead ends: 2315 [2018-12-09 14:57:50,063 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 14:57:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2018-12-09 14:57:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2043. [2018-12-09 14:57:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2018-12-09 14:57:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 5157 transitions. [2018-12-09 14:57:50,092 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 5157 transitions. Word has length 93 [2018-12-09 14:57:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:50,092 INFO L480 AbstractCegarLoop]: Abstraction has 2043 states and 5157 transitions. [2018-12-09 14:57:50,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:57:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 5157 transitions. [2018-12-09 14:57:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 14:57:50,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:50,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:57:50,096 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:50,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:50,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 1 times [2018-12-09 14:57:50,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:50,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:50,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:57:50,222 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 14:57:50,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:57:50,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 14:57:50,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:57:50,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 14:57:50,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 14:57:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 14:57:50,224 INFO L87 Difference]: Start difference. First operand 2043 states and 5157 transitions. Second operand 12 states. [2018-12-09 14:57:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:57:50,585 INFO L93 Difference]: Finished difference Result 3696 states and 9496 transitions. [2018-12-09 14:57:50,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 14:57:50,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-09 14:57:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:57:50,588 INFO L225 Difference]: With dead ends: 3696 [2018-12-09 14:57:50,588 INFO L226 Difference]: Without dead ends: 2720 [2018-12-09 14:57:50,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 14:57:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-12-09 14:57:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2512. [2018-12-09 14:57:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2018-12-09 14:57:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 6216 transitions. [2018-12-09 14:57:50,604 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 6216 transitions. Word has length 93 [2018-12-09 14:57:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:57:50,604 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 6216 transitions. [2018-12-09 14:57:50,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 14:57:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 6216 transitions. [2018-12-09 14:57:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 14:57:50,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:57:50,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:50,606 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:57:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:57:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 211591505, now seen corresponding path program 2 times [2018-12-09 14:57:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:57:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:57:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:57:50,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:57:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:57:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:57:50,651 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 14:57:50,734 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 14:57:50,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:57:50 BasicIcfg [2018-12-09 14:57:50,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:57:50,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:57:50,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:57:50,736 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:57:50,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:57:40" (3/4) ... [2018-12-09 14:57:50,738 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 14:57:50,826 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_782a859b-fc20-4c3d-afd2-87e5fcbef42f/bin-2019/utaipan/witness.graphml [2018-12-09 14:57:50,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:57:50,827 INFO L168 Benchmark]: Toolchain (without parser) took 10888.51 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 956.0 MB in the beginning and 831.6 MB in the end (delta: 124.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,828 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:57:50,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,829 INFO L168 Benchmark]: Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,829 INFO L168 Benchmark]: RCFGBuilder took 345.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,830 INFO L168 Benchmark]: TraceAbstraction took 10079.73 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 858.0 MB in the end (delta: 183.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,830 INFO L168 Benchmark]: Witness Printer took 90.76 ms. Allocated memory is still 2.3 GB. Free memory was 858.0 MB in the beginning and 831.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-09 14:57:50,831 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 345.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10079.73 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 858.0 MB in the end (delta: 183.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 90.76 ms. Allocated memory is still 2.3 GB. Free memory was 858.0 MB in the beginning and 831.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 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] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2482; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 10.0s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5227 SDtfs, 4872 SDslu, 12246 SDs, 0 SdLazy, 4899 SolverSat, 320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37140occurred 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: 2.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 62983 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2145 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2027 ConstructedInterpolants, 0 QuantifiedInterpolants, 443837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...