./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/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 158274064a5b01e53a5759ad2c88b4f4d442183d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 04:12:12,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:12:12,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:12:12,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:12:12,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:12:12,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:12:12,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:12:12,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:12:12,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:12:12,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:12:12,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:12:12,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:12:12,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:12:12,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:12:12,854 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:12:12,855 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:12:12,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:12:12,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:12:12,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:12:12,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:12:12,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:12:12,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:12:12,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:12:12,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:12:12,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:12:12,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:12:12,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:12:12,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:12:12,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:12:12,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:12:12,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:12:12,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:12:12,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:12:12,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:12:12,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:12:12,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:12:12,864 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 04:12:12,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:12:12,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:12:12,871 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:12:12,871 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:12:12,871 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:12:12,872 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 04:12:12,872 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:12:12,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:12:12,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:12:12,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:12:12,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:12:12,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 04:12:12,875 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 04:12:12,875 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_0e1274fb-7abb-429d-8233-4255f2ac43c5/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 -> 158274064a5b01e53a5759ad2c88b4f4d442183d [2018-12-03 04:12:12,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:12:12,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:12:12,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:12:12,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:12:12,905 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:12:12,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i [2018-12-03 04:12:12,950 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/data/81229fee0/3a00a3ca36d7440b8b443b4d23c04c10/FLAG3345c1d8c [2018-12-03 04:12:13,407 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:12:13,408 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i [2018-12-03 04:12:13,415 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/data/81229fee0/3a00a3ca36d7440b8b443b4d23c04c10/FLAG3345c1d8c [2018-12-03 04:12:13,424 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/data/81229fee0/3a00a3ca36d7440b8b443b4d23c04c10 [2018-12-03 04:12:13,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:12:13,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:12:13,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:12:13,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:12:13,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:12:13,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2918fbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13, skipping insertion in model container [2018-12-03 04:12:13,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:12:13,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:12:13,643 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:12:13,651 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:12:13,748 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:12:13,785 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:12:13,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13 WrapperNode [2018-12-03 04:12:13,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:12:13,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:12:13,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:12:13,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:12:13,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:12:13,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:12:13,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:12:13,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:12:13,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... [2018-12-03 04:12:13,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:12:13,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:12:13,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:12:13,851 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:12:13,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/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-03 04:12:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:12:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 04:12:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 04:12:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 04:12:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 04:12:13,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 04:12:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 04:12:13,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 04:12:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 04:12:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:12:13,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:12:13,884 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 04:12:14,238 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:12:14,238 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 04:12:14,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:12:14 BoogieIcfgContainer [2018-12-03 04:12:14,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:12:14,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:12:14,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:12:14,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:12:14,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:12:13" (1/3) ... [2018-12-03 04:12:14,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfeda05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:12:14, skipping insertion in model container [2018-12-03 04:12:14,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:12:13" (2/3) ... [2018-12-03 04:12:14,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfeda05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:12:14, skipping insertion in model container [2018-12-03 04:12:14,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:12:14" (3/3) ... [2018-12-03 04:12:14,242 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc_false-unreach-call.i [2018-12-03 04:12:14,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:12:14,297 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 04:12:14,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:12:14,302 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 04:12:14,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 04:12:14,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:12:14,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:12:14,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:12:14,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:12:14,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:12:14,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:12:14,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:12:14,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:12:14,333 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-03 04:12:22,013 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-03 04:12:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-03 04:12:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 04:12:22,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:12:22,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:12:22,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:12:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:12:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-03 04:12:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:12:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:22,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:12:22,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:22,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:12:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:12:22,157 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-03 04:12:22,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:12:22,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:12:22,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:12:22,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:12:22,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:12:22,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:12:22,171 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-03 04:12:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:12:23,236 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-03 04:12:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:12:23,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-03 04:12:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:12:23,684 INFO L225 Difference]: With dead ends: 192000 [2018-12-03 04:12:23,684 INFO L226 Difference]: Without dead ends: 135832 [2018-12-03 04:12:23,685 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-03 04:12:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-03 04:12:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-03 04:12:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-03 04:12:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-03 04:12:26,573 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-03 04:12:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:12:26,573 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-03 04:12:26,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:12:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-03 04:12:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 04:12:26,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:12:26,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:12:26,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:12:26,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:12:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-03 04:12:26,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:12:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:12:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:26,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:12:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:12:26,633 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-03 04:12:26,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:12:26,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:12:26,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:12:26,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:12:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:12:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:12:26,634 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-03 04:12:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:12:29,327 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-03 04:12:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:12:29,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-03 04:12:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:12:29,726 INFO L225 Difference]: With dead ends: 195844 [2018-12-03 04:12:29,727 INFO L226 Difference]: Without dead ends: 195292 [2018-12-03 04:12:29,727 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-03 04:12:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-03 04:12:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-03 04:12:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-03 04:12:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-03 04:12:33,183 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-03 04:12:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:12:33,184 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-03 04:12:33,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:12:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-03 04:12:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 04:12:33,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:12:33,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:12:33,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:12:33,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:12:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-03 04:12:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:12:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:12:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:33,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:12:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:12:33,246 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-03 04:12:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:12:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:12:33,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:12:33,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:12:33,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:12:33,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:12:33,247 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-03 04:12:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:12:34,761 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-03 04:12:34,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:12:34,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-03 04:12:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:12:35,324 INFO L225 Difference]: With dead ends: 253868 [2018-12-03 04:12:35,324 INFO L226 Difference]: Without dead ends: 253356 [2018-12-03 04:12:35,324 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-03 04:12:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-03 04:12:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-03 04:12:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-03 04:12:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-03 04:12:39,620 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-03 04:12:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:12:39,620 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-03 04:12:39,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:12:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-03 04:12:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 04:12:39,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:12:39,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:12:39,627 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:12:39,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:12:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-03 04:12:39,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:12:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:39,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:12:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:39,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:12:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:12:39,658 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-03 04:12:39,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:12:39,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:12:39,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:12:39,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:12:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:12:39,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:12:39,659 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-03 04:12:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:12:42,440 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-03 04:12:42,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:12:42,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 04:12:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:12:42,890 INFO L225 Difference]: With dead ends: 234162 [2018-12-03 04:12:42,890 INFO L226 Difference]: Without dead ends: 234162 [2018-12-03 04:12:42,891 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-03 04:12:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-03 04:12:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-03 04:12:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-03 04:12:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-03 04:12:47,595 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-03 04:12:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:12:47,595 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-03 04:12:47,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:12:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-03 04:12:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 04:12:47,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:12:47,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:12:47,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:12:47,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:12:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-03 04:12:47,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:12:47,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:47,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:12:47,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:12:47,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:12:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:12:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:12:47,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:12:47,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:12:47,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:12:47,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:12:47,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:12:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:12:47,662 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-03 04:12:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:12:50,232 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-03 04:12:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 04:12:50,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-03 04:12:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:12:51,058 INFO L225 Difference]: With dead ends: 402833 [2018-12-03 04:12:51,059 INFO L226 Difference]: Without dead ends: 402257 [2018-12-03 04:12:51,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 04:12:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-03 04:12:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-03 04:12:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-03 04:13:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-03 04:13:00,624 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-03 04:13:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:00,624 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-03 04:13:00,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:13:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-03 04:13:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 04:13:00,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:00,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:00,640 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:00,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1930693029, now seen corresponding path program 1 times [2018-12-03 04:13:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:00,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:00,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:13:00,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:00,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:00,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:00,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:00,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:00,709 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-03 04:13:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:02,608 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-03 04:13:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 04:13:02,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-03 04:13:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:03,282 INFO L225 Difference]: With dead ends: 325852 [2018-12-03 04:13:03,282 INFO L226 Difference]: Without dead ends: 325852 [2018-12-03 04:13:03,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:13:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-03 04:13:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-03 04:13:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-03 04:13:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-03 04:13:12,029 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-03 04:13:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:12,029 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-03 04:13:12,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-03 04:13:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 04:13:12,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:12,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:12,047 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:12,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:12,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1476770586, now seen corresponding path program 1 times [2018-12-03 04:13:12,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:12,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:12,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:12,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:12,079 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-03 04:13:12,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:12,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:13:12,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:12,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:13:12,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:13:12,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:13:12,080 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 3 states. [2018-12-03 04:13:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:12,882 INFO L93 Difference]: Finished difference Result 209798 states and 761087 transitions. [2018-12-03 04:13:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:13:12,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 04:13:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:13,315 INFO L225 Difference]: With dead ends: 209798 [2018-12-03 04:13:13,315 INFO L226 Difference]: Without dead ends: 209798 [2018-12-03 04:13:13,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:13:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209798 states. [2018-12-03 04:13:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209798 to 207253. [2018-12-03 04:13:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207253 states. [2018-12-03 04:13:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207253 states to 207253 states and 752339 transitions. [2018-12-03 04:13:18,246 INFO L78 Accepts]: Start accepts. Automaton has 207253 states and 752339 transitions. Word has length 54 [2018-12-03 04:13:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:18,246 INFO L480 AbstractCegarLoop]: Abstraction has 207253 states and 752339 transitions. [2018-12-03 04:13:18,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:13:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 207253 states and 752339 transitions. [2018-12-03 04:13:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 04:13:18,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:18,259 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] [2018-12-03 04:13:18,260 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:18,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1480801646, now seen corresponding path program 1 times [2018-12-03 04:13:18,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:18,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:18,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:18,291 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-03 04:13:18,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:18,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:13:18,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:18,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:13:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:13:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:13:18,293 INFO L87 Difference]: Start difference. First operand 207253 states and 752339 transitions. Second operand 4 states. [2018-12-03 04:13:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:18,410 INFO L93 Difference]: Finished difference Result 32822 states and 104262 transitions. [2018-12-03 04:13:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:13:18,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 04:13:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:18,441 INFO L225 Difference]: With dead ends: 32822 [2018-12-03 04:13:18,441 INFO L226 Difference]: Without dead ends: 24964 [2018-12-03 04:13:18,442 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-03 04:13:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2018-12-03 04:13:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24717. [2018-12-03 04:13:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24717 states. [2018-12-03 04:13:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24717 states to 24717 states and 75708 transitions. [2018-12-03 04:13:18,726 INFO L78 Accepts]: Start accepts. Automaton has 24717 states and 75708 transitions. Word has length 55 [2018-12-03 04:13:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:18,726 INFO L480 AbstractCegarLoop]: Abstraction has 24717 states and 75708 transitions. [2018-12-03 04:13:18,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:13:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 24717 states and 75708 transitions. [2018-12-03 04:13:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 04:13:18,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:18,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:18,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:18,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-03 04:13:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:18,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:18,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:18,762 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-03 04:13:18,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:13:18,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:18,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:13:18,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:13:18,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:13:18,763 INFO L87 Difference]: Start difference. First operand 24717 states and 75708 transitions. Second operand 4 states. [2018-12-03 04:13:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:19,162 INFO L93 Difference]: Finished difference Result 27155 states and 82977 transitions. [2018-12-03 04:13:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:13:19,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-03 04:13:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:19,195 INFO L225 Difference]: With dead ends: 27155 [2018-12-03 04:13:19,195 INFO L226 Difference]: Without dead ends: 27155 [2018-12-03 04:13:19,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:13:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27155 states. [2018-12-03 04:13:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27155 to 25562. [2018-12-03 04:13:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2018-12-03 04:13:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 78203 transitions. [2018-12-03 04:13:19,481 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 78203 transitions. Word has length 62 [2018-12-03 04:13:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:19,481 INFO L480 AbstractCegarLoop]: Abstraction has 25562 states and 78203 transitions. [2018-12-03 04:13:19,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:13:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 78203 transitions. [2018-12-03 04:13:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 04:13:19,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:19,485 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] [2018-12-03 04:13:19,485 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:19,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-03 04:13:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:19,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:19,535 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-03 04:13:19,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:19,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:13:19,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:19,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:13:19,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:13:19,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:13:19,536 INFO L87 Difference]: Start difference. First operand 25562 states and 78203 transitions. Second operand 6 states. [2018-12-03 04:13:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:19,980 INFO L93 Difference]: Finished difference Result 53444 states and 162274 transitions. [2018-12-03 04:13:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 04:13:19,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-03 04:13:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:20,047 INFO L225 Difference]: With dead ends: 53444 [2018-12-03 04:13:20,047 INFO L226 Difference]: Without dead ends: 53373 [2018-12-03 04:13:20,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 04:13:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53373 states. [2018-12-03 04:13:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53373 to 32726. [2018-12-03 04:13:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32726 states. [2018-12-03 04:13:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32726 states to 32726 states and 98221 transitions. [2018-12-03 04:13:20,536 INFO L78 Accepts]: Start accepts. Automaton has 32726 states and 98221 transitions. Word has length 62 [2018-12-03 04:13:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:20,536 INFO L480 AbstractCegarLoop]: Abstraction has 32726 states and 98221 transitions. [2018-12-03 04:13:20,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:13:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 32726 states and 98221 transitions. [2018-12-03 04:13:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 04:13:20,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:20,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:20,542 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:20,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-03 04:13:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:20,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:20,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:20,565 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-03 04:13:20,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:20,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:13:20,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:20,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:13:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:13:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:13:20,566 INFO L87 Difference]: Start difference. First operand 32726 states and 98221 transitions. Second operand 3 states. [2018-12-03 04:13:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:20,689 INFO L93 Difference]: Finished difference Result 40875 states and 121466 transitions. [2018-12-03 04:13:20,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:13:20,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-03 04:13:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:20,734 INFO L225 Difference]: With dead ends: 40875 [2018-12-03 04:13:20,735 INFO L226 Difference]: Without dead ends: 40875 [2018-12-03 04:13:20,735 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-03 04:13:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40875 states. [2018-12-03 04:13:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40875 to 33483. [2018-12-03 04:13:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33483 states. [2018-12-03 04:13:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33483 states to 33483 states and 98578 transitions. [2018-12-03 04:13:21,904 INFO L78 Accepts]: Start accepts. Automaton has 33483 states and 98578 transitions. Word has length 68 [2018-12-03 04:13:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:21,904 INFO L480 AbstractCegarLoop]: Abstraction has 33483 states and 98578 transitions. [2018-12-03 04:13:21,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:13:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33483 states and 98578 transitions. [2018-12-03 04:13:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 04:13:21,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:21,912 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] [2018-12-03 04:13:21,912 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:21,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-03 04:13:21,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:21,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:21,946 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-03 04:13:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:13:21,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:21,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:13:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:13:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:13:21,947 INFO L87 Difference]: Start difference. First operand 33483 states and 98578 transitions. Second operand 5 states. [2018-12-03 04:13:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:22,206 INFO L93 Difference]: Finished difference Result 38508 states and 113005 transitions. [2018-12-03 04:13:22,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:13:22,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-03 04:13:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:22,248 INFO L225 Difference]: With dead ends: 38508 [2018-12-03 04:13:22,248 INFO L226 Difference]: Without dead ends: 38508 [2018-12-03 04:13:22,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 04:13:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2018-12-03 04:13:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 36833. [2018-12-03 04:13:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36833 states. [2018-12-03 04:13:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36833 states to 36833 states and 108189 transitions. [2018-12-03 04:13:22,657 INFO L78 Accepts]: Start accepts. Automaton has 36833 states and 108189 transitions. Word has length 74 [2018-12-03 04:13:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:22,657 INFO L480 AbstractCegarLoop]: Abstraction has 36833 states and 108189 transitions. [2018-12-03 04:13:22,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:13:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36833 states and 108189 transitions. [2018-12-03 04:13:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 04:13:22,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:22,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:22,666 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:22,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-03 04:13:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:22,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:22,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:22,720 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-03 04:13:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:22,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:22,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:22,721 INFO L87 Difference]: Start difference. First operand 36833 states and 108189 transitions. Second operand 7 states. [2018-12-03 04:13:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:23,254 INFO L93 Difference]: Finished difference Result 44363 states and 130601 transitions. [2018-12-03 04:13:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 04:13:23,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-03 04:13:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:23,304 INFO L225 Difference]: With dead ends: 44363 [2018-12-03 04:13:23,304 INFO L226 Difference]: Without dead ends: 44276 [2018-12-03 04:13:23,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-03 04:13:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44276 states. [2018-12-03 04:13:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44276 to 33054. [2018-12-03 04:13:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33054 states. [2018-12-03 04:13:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33054 states to 33054 states and 98260 transitions. [2018-12-03 04:13:23,721 INFO L78 Accepts]: Start accepts. Automaton has 33054 states and 98260 transitions. Word has length 74 [2018-12-03 04:13:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:23,721 INFO L480 AbstractCegarLoop]: Abstraction has 33054 states and 98260 transitions. [2018-12-03 04:13:23,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33054 states and 98260 transitions. [2018-12-03 04:13:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 04:13:23,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:23,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:23,731 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:23,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-03 04:13:23,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:23,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:23,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:23,778 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-03 04:13:23,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:23,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:23,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:23,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:23,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:23,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:23,779 INFO L87 Difference]: Start difference. First operand 33054 states and 98260 transitions. Second operand 7 states. [2018-12-03 04:13:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:24,459 INFO L93 Difference]: Finished difference Result 73264 states and 216100 transitions. [2018-12-03 04:13:24,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 04:13:24,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-03 04:13:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:24,547 INFO L225 Difference]: With dead ends: 73264 [2018-12-03 04:13:24,547 INFO L226 Difference]: Without dead ends: 73200 [2018-12-03 04:13:24,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-03 04:13:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73200 states. [2018-12-03 04:13:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73200 to 42473. [2018-12-03 04:13:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42473 states. [2018-12-03 04:13:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42473 states to 42473 states and 124402 transitions. [2018-12-03 04:13:25,157 INFO L78 Accepts]: Start accepts. Automaton has 42473 states and 124402 transitions. Word has length 76 [2018-12-03 04:13:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:25,157 INFO L480 AbstractCegarLoop]: Abstraction has 42473 states and 124402 transitions. [2018-12-03 04:13:25,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42473 states and 124402 transitions. [2018-12-03 04:13:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 04:13:25,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:25,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:25,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:25,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1584283171, now seen corresponding path program 1 times [2018-12-03 04:13:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:25,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:25,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:25,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:25,220 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-03 04:13:25,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:25,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:13:25,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:25,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:13:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:13:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:13:25,221 INFO L87 Difference]: Start difference. First operand 42473 states and 124402 transitions. Second operand 4 states. [2018-12-03 04:13:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:25,377 INFO L93 Difference]: Finished difference Result 47450 states and 136404 transitions. [2018-12-03 04:13:25,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:13:25,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-03 04:13:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:25,428 INFO L225 Difference]: With dead ends: 47450 [2018-12-03 04:13:25,428 INFO L226 Difference]: Without dead ends: 47450 [2018-12-03 04:13:25,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:13:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47450 states. [2018-12-03 04:13:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47450 to 43792. [2018-12-03 04:13:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43792 states. [2018-12-03 04:13:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43792 states to 43792 states and 125556 transitions. [2018-12-03 04:13:25,907 INFO L78 Accepts]: Start accepts. Automaton has 43792 states and 125556 transitions. Word has length 83 [2018-12-03 04:13:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:25,907 INFO L480 AbstractCegarLoop]: Abstraction has 43792 states and 125556 transitions. [2018-12-03 04:13:25,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:13:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 43792 states and 125556 transitions. [2018-12-03 04:13:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 04:13:25,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:25,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:25,924 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:25,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1366691952, now seen corresponding path program 1 times [2018-12-03 04:13:25,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:25,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:25,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:25,976 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-03 04:13:25,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:25,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:13:25,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:25,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:13:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:13:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:13:25,977 INFO L87 Difference]: Start difference. First operand 43792 states and 125556 transitions. Second operand 4 states. [2018-12-03 04:13:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:26,502 INFO L93 Difference]: Finished difference Result 51886 states and 146275 transitions. [2018-12-03 04:13:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:13:26,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-03 04:13:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:26,551 INFO L225 Difference]: With dead ends: 51886 [2018-12-03 04:13:26,551 INFO L226 Difference]: Without dead ends: 51886 [2018-12-03 04:13:26,551 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-03 04:13:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states. [2018-12-03 04:13:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 49652. [2018-12-03 04:13:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49652 states. [2018-12-03 04:13:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49652 states to 49652 states and 140792 transitions. [2018-12-03 04:13:27,066 INFO L78 Accepts]: Start accepts. Automaton has 49652 states and 140792 transitions. Word has length 84 [2018-12-03 04:13:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:27,066 INFO L480 AbstractCegarLoop]: Abstraction has 49652 states and 140792 transitions. [2018-12-03 04:13:27,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:13:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 49652 states and 140792 transitions. [2018-12-03 04:13:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 04:13:27,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:27,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:27,083 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:27,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 851066001, now seen corresponding path program 1 times [2018-12-03 04:13:27,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:27,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:27,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:27,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-03 04:13:27,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:13:27,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:27,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:13:27,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:13:27,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:13:27,120 INFO L87 Difference]: Start difference. First operand 49652 states and 140792 transitions. Second operand 5 states. [2018-12-03 04:13:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:27,178 INFO L93 Difference]: Finished difference Result 22000 states and 53993 transitions. [2018-12-03 04:13:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:13:27,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-12-03 04:13:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:27,192 INFO L225 Difference]: With dead ends: 22000 [2018-12-03 04:13:27,193 INFO L226 Difference]: Without dead ends: 20041 [2018-12-03 04:13:27,193 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-03 04:13:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20041 states. [2018-12-03 04:13:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20041 to 16787. [2018-12-03 04:13:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16787 states. [2018-12-03 04:13:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16787 states to 16787 states and 41093 transitions. [2018-12-03 04:13:27,354 INFO L78 Accepts]: Start accepts. Automaton has 16787 states and 41093 transitions. Word has length 84 [2018-12-03 04:13:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:27,355 INFO L480 AbstractCegarLoop]: Abstraction has 16787 states and 41093 transitions. [2018-12-03 04:13:27,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:13:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16787 states and 41093 transitions. [2018-12-03 04:13:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:27,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:27,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:27,367 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:27,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -143937600, now seen corresponding path program 1 times [2018-12-03 04:13:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:27,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:27,420 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-03 04:13:27,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:27,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:13:27,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:27,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:13:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:13:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:13:27,421 INFO L87 Difference]: Start difference. First operand 16787 states and 41093 transitions. Second operand 5 states. [2018-12-03 04:13:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:27,511 INFO L93 Difference]: Finished difference Result 19597 states and 47367 transitions. [2018-12-03 04:13:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:13:27,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-03 04:13:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:27,525 INFO L225 Difference]: With dead ends: 19597 [2018-12-03 04:13:27,525 INFO L226 Difference]: Without dead ends: 19597 [2018-12-03 04:13:27,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2018-12-03 04:13:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 15476. [2018-12-03 04:13:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2018-12-03 04:13:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 37384 transitions. [2018-12-03 04:13:27,670 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 37384 transitions. Word has length 113 [2018-12-03 04:13:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:27,670 INFO L480 AbstractCegarLoop]: Abstraction has 15476 states and 37384 transitions. [2018-12-03 04:13:27,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:13:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 37384 transitions. [2018-12-03 04:13:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:27,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:27,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:27,681 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:27,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash -123600225, now seen corresponding path program 1 times [2018-12-03 04:13:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:27,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:27,731 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-03 04:13:27,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:13:27,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:27,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:13:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:13:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:13:27,732 INFO L87 Difference]: Start difference. First operand 15476 states and 37384 transitions. Second operand 5 states. [2018-12-03 04:13:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:28,117 INFO L93 Difference]: Finished difference Result 18394 states and 44376 transitions. [2018-12-03 04:13:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:13:28,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-03 04:13:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:28,133 INFO L225 Difference]: With dead ends: 18394 [2018-12-03 04:13:28,134 INFO L226 Difference]: Without dead ends: 18380 [2018-12-03 04:13:28,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-03 04:13:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16712. [2018-12-03 04:13:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16712 states. [2018-12-03 04:13:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16712 states to 16712 states and 40590 transitions. [2018-12-03 04:13:28,287 INFO L78 Accepts]: Start accepts. Automaton has 16712 states and 40590 transitions. Word has length 113 [2018-12-03 04:13:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:28,287 INFO L480 AbstractCegarLoop]: Abstraction has 16712 states and 40590 transitions. [2018-12-03 04:13:28,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:13:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 16712 states and 40590 transitions. [2018-12-03 04:13:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:28,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:28,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:13:28,300 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:28,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash -172499590, now seen corresponding path program 1 times [2018-12-03 04:13:28,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:28,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:28,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:28,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:28,463 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-03 04:13:28,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:28,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 04:13:28,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:28,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 04:13:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 04:13:28,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:13:28,464 INFO L87 Difference]: Start difference. First operand 16712 states and 40590 transitions. Second operand 10 states. [2018-12-03 04:13:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:29,241 INFO L93 Difference]: Finished difference Result 25371 states and 59279 transitions. [2018-12-03 04:13:29,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 04:13:29,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-03 04:13:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:29,272 INFO L225 Difference]: With dead ends: 25371 [2018-12-03 04:13:29,272 INFO L226 Difference]: Without dead ends: 25371 [2018-12-03 04:13:29,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2018-12-03 04:13:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25371 states. [2018-12-03 04:13:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25371 to 21705. [2018-12-03 04:13:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21705 states. [2018-12-03 04:13:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21705 states to 21705 states and 51438 transitions. [2018-12-03 04:13:29,483 INFO L78 Accepts]: Start accepts. Automaton has 21705 states and 51438 transitions. Word has length 113 [2018-12-03 04:13:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:29,483 INFO L480 AbstractCegarLoop]: Abstraction has 21705 states and 51438 transitions. [2018-12-03 04:13:29,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 04:13:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 21705 states and 51438 transitions. [2018-12-03 04:13:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:29,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:29,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:29,500 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:29,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1009590368, now seen corresponding path program 1 times [2018-12-03 04:13:29,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:29,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:29,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:29,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:29,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:29,556 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-03 04:13:29,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:29,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:13:29,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:13:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:13:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:13:29,557 INFO L87 Difference]: Start difference. First operand 21705 states and 51438 transitions. Second operand 4 states. [2018-12-03 04:13:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:29,716 INFO L93 Difference]: Finished difference Result 23713 states and 55860 transitions. [2018-12-03 04:13:29,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:13:29,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-03 04:13:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:29,733 INFO L225 Difference]: With dead ends: 23713 [2018-12-03 04:13:29,733 INFO L226 Difference]: Without dead ends: 23693 [2018-12-03 04:13:29,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:13:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23693 states. [2018-12-03 04:13:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23693 to 22563. [2018-12-03 04:13:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22563 states. [2018-12-03 04:13:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22563 states to 22563 states and 53386 transitions. [2018-12-03 04:13:29,934 INFO L78 Accepts]: Start accepts. Automaton has 22563 states and 53386 transitions. Word has length 113 [2018-12-03 04:13:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:29,934 INFO L480 AbstractCegarLoop]: Abstraction has 22563 states and 53386 transitions. [2018-12-03 04:13:29,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:13:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 22563 states and 53386 transitions. [2018-12-03 04:13:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:29,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:29,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:29,952 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:29,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2040612447, now seen corresponding path program 1 times [2018-12-03 04:13:29,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:29,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:29,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:30,023 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-03 04:13:30,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:30,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:30,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:30,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:30,024 INFO L87 Difference]: Start difference. First operand 22563 states and 53386 transitions. Second operand 7 states. [2018-12-03 04:13:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:30,485 INFO L93 Difference]: Finished difference Result 31735 states and 73323 transitions. [2018-12-03 04:13:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:13:30,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-03 04:13:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:30,508 INFO L225 Difference]: With dead ends: 31735 [2018-12-03 04:13:30,508 INFO L226 Difference]: Without dead ends: 31704 [2018-12-03 04:13:30,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 04:13:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31704 states. [2018-12-03 04:13:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31704 to 27494. [2018-12-03 04:13:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27494 states. [2018-12-03 04:13:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27494 states to 27494 states and 63776 transitions. [2018-12-03 04:13:30,778 INFO L78 Accepts]: Start accepts. Automaton has 27494 states and 63776 transitions. Word has length 113 [2018-12-03 04:13:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:30,778 INFO L480 AbstractCegarLoop]: Abstraction has 27494 states and 63776 transitions. [2018-12-03 04:13:30,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 27494 states and 63776 transitions. [2018-12-03 04:13:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:30,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:30,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:30,799 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:30,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash 177145506, now seen corresponding path program 1 times [2018-12-03 04:13:30,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:30,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:30,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:30,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:30,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:30,872 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-03 04:13:30,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:30,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 04:13:30,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:30,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 04:13:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 04:13:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:13:30,873 INFO L87 Difference]: Start difference. First operand 27494 states and 63776 transitions. Second operand 8 states. [2018-12-03 04:13:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:31,993 INFO L93 Difference]: Finished difference Result 34345 states and 79026 transitions. [2018-12-03 04:13:31,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 04:13:31,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-03 04:13:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:32,023 INFO L225 Difference]: With dead ends: 34345 [2018-12-03 04:13:32,023 INFO L226 Difference]: Without dead ends: 34345 [2018-12-03 04:13:32,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-03 04:13:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2018-12-03 04:13:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 31008. [2018-12-03 04:13:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31008 states. [2018-12-03 04:13:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31008 states to 31008 states and 71866 transitions. [2018-12-03 04:13:32,335 INFO L78 Accepts]: Start accepts. Automaton has 31008 states and 71866 transitions. Word has length 113 [2018-12-03 04:13:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:32,335 INFO L480 AbstractCegarLoop]: Abstraction has 31008 states and 71866 transitions. [2018-12-03 04:13:32,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 04:13:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 31008 states and 71866 transitions. [2018-12-03 04:13:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:32,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:32,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:32,359 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:32,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash 388496419, now seen corresponding path program 1 times [2018-12-03 04:13:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:32,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:32,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:32,404 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-03 04:13:32,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:32,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:13:32,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:32,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:13:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:13:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:13:32,405 INFO L87 Difference]: Start difference. First operand 31008 states and 71866 transitions. Second operand 3 states. [2018-12-03 04:13:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:32,486 INFO L93 Difference]: Finished difference Result 40201 states and 92482 transitions. [2018-12-03 04:13:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:13:32,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-03 04:13:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:32,521 INFO L225 Difference]: With dead ends: 40201 [2018-12-03 04:13:32,521 INFO L226 Difference]: Without dead ends: 40201 [2018-12-03 04:13:32,522 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-03 04:13:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40201 states. [2018-12-03 04:13:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40201 to 39802. [2018-12-03 04:13:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39802 states. [2018-12-03 04:13:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39802 states to 39802 states and 91600 transitions. [2018-12-03 04:13:32,873 INFO L78 Accepts]: Start accepts. Automaton has 39802 states and 91600 transitions. Word has length 113 [2018-12-03 04:13:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:32,873 INFO L480 AbstractCegarLoop]: Abstraction has 39802 states and 91600 transitions. [2018-12-03 04:13:32,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:13:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39802 states and 91600 transitions. [2018-12-03 04:13:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:32,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:32,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:13:32,902 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:32,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2113977316, now seen corresponding path program 1 times [2018-12-03 04:13:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:32,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:32,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:32,987 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-03 04:13:32,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:32,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:32,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:32,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:32,988 INFO L87 Difference]: Start difference. First operand 39802 states and 91600 transitions. Second operand 7 states. [2018-12-03 04:13:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:33,153 INFO L93 Difference]: Finished difference Result 44479 states and 101392 transitions. [2018-12-03 04:13:33,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:13:33,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-03 04:13:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:33,187 INFO L225 Difference]: With dead ends: 44479 [2018-12-03 04:13:33,187 INFO L226 Difference]: Without dead ends: 44479 [2018-12-03 04:13:33,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:13:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44479 states. [2018-12-03 04:13:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44479 to 39582. [2018-12-03 04:13:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39582 states. [2018-12-03 04:13:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39582 states to 39582 states and 90900 transitions. [2018-12-03 04:13:33,568 INFO L78 Accepts]: Start accepts. Automaton has 39582 states and 90900 transitions. Word has length 113 [2018-12-03 04:13:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:33,568 INFO L480 AbstractCegarLoop]: Abstraction has 39582 states and 90900 transitions. [2018-12-03 04:13:33,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 39582 states and 90900 transitions. [2018-12-03 04:13:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:33,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:33,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:33,596 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:33,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:33,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1913942530, now seen corresponding path program 1 times [2018-12-03 04:13:33,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:33,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:33,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:33,669 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-03 04:13:33,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:33,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:33,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:33,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:33,670 INFO L87 Difference]: Start difference. First operand 39582 states and 90900 transitions. Second operand 7 states. [2018-12-03 04:13:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:34,037 INFO L93 Difference]: Finished difference Result 49020 states and 110509 transitions. [2018-12-03 04:13:34,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 04:13:34,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-03 04:13:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:34,075 INFO L225 Difference]: With dead ends: 49020 [2018-12-03 04:13:34,075 INFO L226 Difference]: Without dead ends: 49020 [2018-12-03 04:13:34,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-03 04:13:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49020 states. [2018-12-03 04:13:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49020 to 41218. [2018-12-03 04:13:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41218 states. [2018-12-03 04:13:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41218 states to 41218 states and 93774 transitions. [2018-12-03 04:13:34,518 INFO L78 Accepts]: Start accepts. Automaton has 41218 states and 93774 transitions. Word has length 113 [2018-12-03 04:13:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:34,518 INFO L480 AbstractCegarLoop]: Abstraction has 41218 states and 93774 transitions. [2018-12-03 04:13:34,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 41218 states and 93774 transitions. [2018-12-03 04:13:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:34,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:34,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:34,548 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:34,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2125293443, now seen corresponding path program 1 times [2018-12-03 04:13:34,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:34,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:34,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:34,640 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-03 04:13:34,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:34,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:13:34,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:34,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:13:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:13:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:13:34,641 INFO L87 Difference]: Start difference. First operand 41218 states and 93774 transitions. Second operand 7 states. [2018-12-03 04:13:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:34,864 INFO L93 Difference]: Finished difference Result 42748 states and 97010 transitions. [2018-12-03 04:13:34,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:13:34,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-03 04:13:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:34,897 INFO L225 Difference]: With dead ends: 42748 [2018-12-03 04:13:34,897 INFO L226 Difference]: Without dead ends: 42748 [2018-12-03 04:13:34,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:13:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42748 states. [2018-12-03 04:13:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42748 to 41656. [2018-12-03 04:13:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41656 states. [2018-12-03 04:13:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41656 states to 41656 states and 94781 transitions. [2018-12-03 04:13:35,266 INFO L78 Accepts]: Start accepts. Automaton has 41656 states and 94781 transitions. Word has length 113 [2018-12-03 04:13:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:35,267 INFO L480 AbstractCegarLoop]: Abstraction has 41656 states and 94781 transitions. [2018-12-03 04:13:35,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:13:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 41656 states and 94781 transitions. [2018-12-03 04:13:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:35,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:35,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:35,298 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:35,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1282170172, now seen corresponding path program 1 times [2018-12-03 04:13:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:35,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:35,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:35,379 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-03 04:13:35,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 04:13:35,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:35,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 04:13:35,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 04:13:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:13:35,379 INFO L87 Difference]: Start difference. First operand 41656 states and 94781 transitions. Second operand 8 states. [2018-12-03 04:13:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:35,793 INFO L93 Difference]: Finished difference Result 49333 states and 111431 transitions. [2018-12-03 04:13:35,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:13:35,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-03 04:13:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:35,834 INFO L225 Difference]: With dead ends: 49333 [2018-12-03 04:13:35,834 INFO L226 Difference]: Without dead ends: 49333 [2018-12-03 04:13:35,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:13:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49333 states. [2018-12-03 04:13:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49333 to 42948. [2018-12-03 04:13:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42948 states. [2018-12-03 04:13:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42948 states to 42948 states and 97552 transitions. [2018-12-03 04:13:36,237 INFO L78 Accepts]: Start accepts. Automaton has 42948 states and 97552 transitions. Word has length 113 [2018-12-03 04:13:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:36,237 INFO L480 AbstractCegarLoop]: Abstraction has 42948 states and 97552 transitions. [2018-12-03 04:13:36,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 04:13:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 42948 states and 97552 transitions. [2018-12-03 04:13:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:36,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:36,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:36,268 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:36,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash -517283510, now seen corresponding path program 2 times [2018-12-03 04:13:36,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:36,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:13:36,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:36,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 04:13:36,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:36,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 04:13:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 04:13:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:13:36,354 INFO L87 Difference]: Start difference. First operand 42948 states and 97552 transitions. Second operand 8 states. [2018-12-03 04:13:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:36,774 INFO L93 Difference]: Finished difference Result 51746 states and 117038 transitions. [2018-12-03 04:13:36,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:13:36,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-03 04:13:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:36,817 INFO L225 Difference]: With dead ends: 51746 [2018-12-03 04:13:36,817 INFO L226 Difference]: Without dead ends: 51746 [2018-12-03 04:13:36,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:13:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51746 states. [2018-12-03 04:13:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51746 to 41173. [2018-12-03 04:13:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41173 states. [2018-12-03 04:13:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41173 states to 41173 states and 93573 transitions. [2018-12-03 04:13:37,242 INFO L78 Accepts]: Start accepts. Automaton has 41173 states and 93573 transitions. Word has length 113 [2018-12-03 04:13:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:37,242 INFO L480 AbstractCegarLoop]: Abstraction has 41173 states and 93573 transitions. [2018-12-03 04:13:37,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 04:13:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 41173 states and 93573 transitions. [2018-12-03 04:13:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:37,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:37,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:13:37,272 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:37,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash -835478879, now seen corresponding path program 1 times [2018-12-03 04:13:37,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:37,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:37,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:13:37,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:37,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:37,371 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-03 04:13:37,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:37,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 04:13:37,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:37,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 04:13:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 04:13:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:13:37,372 INFO L87 Difference]: Start difference. First operand 41173 states and 93573 transitions. Second operand 8 states. [2018-12-03 04:13:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:38,133 INFO L93 Difference]: Finished difference Result 57102 states and 129961 transitions. [2018-12-03 04:13:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 04:13:38,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-03 04:13:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:38,181 INFO L225 Difference]: With dead ends: 57102 [2018-12-03 04:13:38,181 INFO L226 Difference]: Without dead ends: 57102 [2018-12-03 04:13:38,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 04:13:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57102 states. [2018-12-03 04:13:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57102 to 40788. [2018-12-03 04:13:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40788 states. [2018-12-03 04:13:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40788 states to 40788 states and 92755 transitions. [2018-12-03 04:13:38,636 INFO L78 Accepts]: Start accepts. Automaton has 40788 states and 92755 transitions. Word has length 113 [2018-12-03 04:13:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:38,636 INFO L480 AbstractCegarLoop]: Abstraction has 40788 states and 92755 transitions. [2018-12-03 04:13:38,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 04:13:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40788 states and 92755 transitions. [2018-12-03 04:13:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:13:38,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:38,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:13:38,666 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:38,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1632202250, now seen corresponding path program 3 times [2018-12-03 04:13:38,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:38,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:13:38,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:38,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:13:38,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:38,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:13:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:13:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:13:38,709 INFO L87 Difference]: Start difference. First operand 40788 states and 92755 transitions. Second operand 6 states. [2018-12-03 04:13:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:39,025 INFO L93 Difference]: Finished difference Result 46201 states and 104047 transitions. [2018-12-03 04:13:39,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:13:39,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-03 04:13:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:39,060 INFO L225 Difference]: With dead ends: 46201 [2018-12-03 04:13:39,060 INFO L226 Difference]: Without dead ends: 46181 [2018-12-03 04:13:39,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:13:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46181 states. [2018-12-03 04:13:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46181 to 41301. [2018-12-03 04:13:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41301 states. [2018-12-03 04:13:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41301 states to 41301 states and 93806 transitions. [2018-12-03 04:13:39,450 INFO L78 Accepts]: Start accepts. Automaton has 41301 states and 93806 transitions. Word has length 113 [2018-12-03 04:13:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:39,450 INFO L480 AbstractCegarLoop]: Abstraction has 41301 states and 93806 transitions. [2018-12-03 04:13:39,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:13:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 41301 states and 93806 transitions. [2018-12-03 04:13:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:13:39,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:39,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:39,481 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:39,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:39,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1618364905, now seen corresponding path program 1 times [2018-12-03 04:13:39,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:39,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:13:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:39,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:39,587 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-03 04:13:39,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:39,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 04:13:39,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:39,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 04:13:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 04:13:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-03 04:13:39,588 INFO L87 Difference]: Start difference. First operand 41301 states and 93806 transitions. Second operand 14 states. [2018-12-03 04:13:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:40,010 INFO L93 Difference]: Finished difference Result 69626 states and 158138 transitions. [2018-12-03 04:13:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 04:13:40,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-12-03 04:13:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:40,055 INFO L225 Difference]: With dead ends: 69626 [2018-12-03 04:13:40,055 INFO L226 Difference]: Without dead ends: 57326 [2018-12-03 04:13:40,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-12-03 04:13:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57326 states. [2018-12-03 04:13:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57326 to 46406. [2018-12-03 04:13:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46406 states. [2018-12-03 04:13:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46406 states to 46406 states and 104918 transitions. [2018-12-03 04:13:40,502 INFO L78 Accepts]: Start accepts. Automaton has 46406 states and 104918 transitions. Word has length 115 [2018-12-03 04:13:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:40,502 INFO L480 AbstractCegarLoop]: Abstraction has 46406 states and 104918 transitions. [2018-12-03 04:13:40,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 04:13:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 46406 states and 104918 transitions. [2018-12-03 04:13:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:13:40,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:40,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:40,535 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:40,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:40,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1652705303, now seen corresponding path program 2 times [2018-12-03 04:13:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:40,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:40,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:40,648 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-03 04:13:40,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:40,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 04:13:40,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:40,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 04:13:40,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 04:13:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-03 04:13:40,649 INFO L87 Difference]: Start difference. First operand 46406 states and 104918 transitions. Second operand 14 states. [2018-12-03 04:13:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:41,371 INFO L93 Difference]: Finished difference Result 98560 states and 224299 transitions. [2018-12-03 04:13:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 04:13:41,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-12-03 04:13:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:41,435 INFO L225 Difference]: With dead ends: 98560 [2018-12-03 04:13:41,435 INFO L226 Difference]: Without dead ends: 75334 [2018-12-03 04:13:41,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 04:13:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75334 states. [2018-12-03 04:13:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75334 to 53252. [2018-12-03 04:13:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53252 states. [2018-12-03 04:13:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53252 states to 53252 states and 118965 transitions. [2018-12-03 04:13:42,050 INFO L78 Accepts]: Start accepts. Automaton has 53252 states and 118965 transitions. Word has length 115 [2018-12-03 04:13:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:42,050 INFO L480 AbstractCegarLoop]: Abstraction has 53252 states and 118965 transitions. [2018-12-03 04:13:42,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 04:13:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53252 states and 118965 transitions. [2018-12-03 04:13:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:13:42,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:42,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:42,093 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:42,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash -601462811, now seen corresponding path program 3 times [2018-12-03 04:13:42,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:42,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:13:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:42,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:13:42,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:42,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-03 04:13:42,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:42,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 04:13:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 04:13:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-12-03 04:13:42,235 INFO L87 Difference]: Start difference. First operand 53252 states and 118965 transitions. Second operand 16 states. [2018-12-03 04:13:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:42,959 INFO L93 Difference]: Finished difference Result 76098 states and 170994 transitions. [2018-12-03 04:13:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 04:13:42,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-12-03 04:13:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:43,006 INFO L225 Difference]: With dead ends: 76098 [2018-12-03 04:13:43,006 INFO L226 Difference]: Without dead ends: 65763 [2018-12-03 04:13:43,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 04:13:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65763 states. [2018-12-03 04:13:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65763 to 53977. [2018-12-03 04:13:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53977 states. [2018-12-03 04:13:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53977 states to 53977 states and 120641 transitions. [2018-12-03 04:13:43,554 INFO L78 Accepts]: Start accepts. Automaton has 53977 states and 120641 transitions. Word has length 115 [2018-12-03 04:13:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:43,555 INFO L480 AbstractCegarLoop]: Abstraction has 53977 states and 120641 transitions. [2018-12-03 04:13:43,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 04:13:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 53977 states and 120641 transitions. [2018-12-03 04:13:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:13:43,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:43,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:43,599 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:43,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1418655316, now seen corresponding path program 1 times [2018-12-03 04:13:43,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:43,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:43,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:13:43,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:43,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:13:43,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:43,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-03 04:13:43,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:43,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 04:13:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 04:13:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-12-03 04:13:43,760 INFO L87 Difference]: Start difference. First operand 53977 states and 120641 transitions. Second operand 17 states. [2018-12-03 04:13:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:44,523 INFO L93 Difference]: Finished difference Result 77212 states and 173975 transitions. [2018-12-03 04:13:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 04:13:44,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2018-12-03 04:13:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:44,576 INFO L225 Difference]: With dead ends: 77212 [2018-12-03 04:13:44,576 INFO L226 Difference]: Without dead ends: 65847 [2018-12-03 04:13:44,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 04:13:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65847 states. [2018-12-03 04:13:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65847 to 51808. [2018-12-03 04:13:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51808 states. [2018-12-03 04:13:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51808 states to 51808 states and 115966 transitions. [2018-12-03 04:13:45,145 INFO L78 Accepts]: Start accepts. Automaton has 51808 states and 115966 transitions. Word has length 115 [2018-12-03 04:13:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:45,145 INFO L480 AbstractCegarLoop]: Abstraction has 51808 states and 115966 transitions. [2018-12-03 04:13:45,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 04:13:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 51808 states and 115966 transitions. [2018-12-03 04:13:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:13:45,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:45,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:45,189 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:45,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:45,189 INFO L82 PathProgramCache]: Analyzing trace with hash 415062155, now seen corresponding path program 4 times [2018-12-03 04:13:45,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:45,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:13:45,305 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-03 04:13:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:13:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 04:13:45,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:13:45,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 04:13:45,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 04:13:45,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:13:45,306 INFO L87 Difference]: Start difference. First operand 51808 states and 115966 transitions. Second operand 10 states. [2018-12-03 04:13:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:13:45,720 INFO L93 Difference]: Finished difference Result 60244 states and 134882 transitions. [2018-12-03 04:13:45,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:13:45,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-12-03 04:13:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:13:45,726 INFO L225 Difference]: With dead ends: 60244 [2018-12-03 04:13:45,726 INFO L226 Difference]: Without dead ends: 7529 [2018-12-03 04:13:45,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-03 04:13:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2018-12-03 04:13:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 7529. [2018-12-03 04:13:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-03 04:13:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17643 transitions. [2018-12-03 04:13:45,833 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17643 transitions. Word has length 115 [2018-12-03 04:13:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:13:45,833 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17643 transitions. [2018-12-03 04:13:45,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 04:13:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17643 transitions. [2018-12-03 04:13:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:13:45,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:13:45,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:13:45,838 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:13:45,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:13:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 1 times [2018-12-03 04:13:45,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:13:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:45,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:13:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:13:45,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:13:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:13:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:13:45,896 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 04:13:45,988 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 04:13:45,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:13:45 BasicIcfg [2018-12-03 04:13:45,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 04:13:45,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 04:13:45,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 04:13:45,990 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 04:13:45,990 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:12:14" (3/4) ... [2018-12-03 04:13:45,992 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 04:13:46,075 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0e1274fb-7abb-429d-8233-4255f2ac43c5/bin-2019/utaipan/witness.graphml [2018-12-03 04:13:46,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 04:13:46,076 INFO L168 Benchmark]: Toolchain (without parser) took 92650.17 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 948.1 MB in the beginning and 5.8 GB in the end (delta: -4.8 GB). Peak memory consumption was 705.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:13:46,077 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:13:46,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-03 04:13:46,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.65 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 04:13:46,077 INFO L168 Benchmark]: Boogie Preprocessor took 21.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:13:46,078 INFO L168 Benchmark]: RCFGBuilder took 387.21 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2018-12-03 04:13:46,078 INFO L168 Benchmark]: TraceAbstraction took 91750.81 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: -4.8 GB). Peak memory consumption was 633.1 MB. Max. memory is 11.5 GB. [2018-12-03 04:13:46,078 INFO L168 Benchmark]: Witness Printer took 85.94 ms. Allocated memory is still 6.6 GB. Free memory was 5.8 GB in the beginning and 5.8 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-12-03 04:13:46,079 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.65 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.21 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91750.81 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: -4.8 GB). Peak memory consumption was 633.1 MB. Max. memory is 11.5 GB. * Witness Printer took 85.94 ms. Allocated memory is still 6.6 GB. Free memory was 5.8 GB in the beginning and 5.8 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1723; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1724; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -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) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -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 [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 91.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17099 SDtfs, 21496 SDslu, 65344 SDs, 0 SdLazy, 14669 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 105 SyntacticMatches, 30 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, 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: 50.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 752563 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3336 NumberOfCodeBlocks, 3336 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 888899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...