./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_tso.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_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/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 c41624855bfeff2950c7f36e01e180710b5ddc84 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:05:04,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:05:04,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:05:04,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:05:04,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:05:04,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:05:04,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:05:04,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:05:04,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:05:04,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:05:04,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:05:04,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:05:04,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:05:04,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:05:04,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:05:04,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:05:04,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:05:04,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:05:04,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:05:04,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:05:04,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:05:04,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:05:04,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:05:04,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:05:04,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:05:04,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:05:04,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:05:04,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:05:04,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:05:04,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:05:04,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:05:04,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:05:04,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:05:04,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:05:04,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:05:04,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:05:04,759 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:05:04,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:05:04,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:05:04,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:05:04,771 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:05:04,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:05:04,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:05:04,771 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:05:04,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:05:04,772 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:05:04,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:05:04,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:05:04,772 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:05:04,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:05:04,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:05:04,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:05:04,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:05:04,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:05:04,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:05:04,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:05:04,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:05:04,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:05:04,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:05:04,774 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:05:04,774 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:05:04,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:05:04,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:05:04,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:05:04,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:05:04,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:05:04,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:05:04,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:05:04,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:05:04,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:05:04,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:05:04,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:05:04,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:05:04,776 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_a674e628-8f2b-467e-8aff-db59da95b3e8/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 -> c41624855bfeff2950c7f36e01e180710b5ddc84 [2018-12-09 17:05:04,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:05:04,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:05:04,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:05:04,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:05:04,814 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:05:04,814 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_tso.oepc_false-unreach-call.i [2018-12-09 17:05:04,858 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/data/77af67f40/3930bc3c00b5439ea8a94e04deb2ca14/FLAG6fc64c0f9 [2018-12-09 17:05:05,209 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:05:05,209 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/sv-benchmarks/c/pthread-wmm/mix041_tso.oepc_false-unreach-call.i [2018-12-09 17:05:05,216 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/data/77af67f40/3930bc3c00b5439ea8a94e04deb2ca14/FLAG6fc64c0f9 [2018-12-09 17:05:05,593 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/data/77af67f40/3930bc3c00b5439ea8a94e04deb2ca14 [2018-12-09 17:05:05,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:05:05,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:05:05,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:05:05,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:05:05,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:05:05,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126510b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05, skipping insertion in model container [2018-12-09 17:05:05,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:05:05,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:05:05,801 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:05:05,809 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:05:05,896 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:05:05,929 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:05:05,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05 WrapperNode [2018-12-09 17:05:05,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:05:05,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:05:05,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:05:05,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:05:05,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:05:05,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:05:05,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:05:05,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:05:05,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... [2018-12-09 17:05:05,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:05:05,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:05:05,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:05:05,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:05:05,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:05:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:05:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:05:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 17:05:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:05:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 17:05:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 17:05:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 17:05:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 17:05:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 17:05:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:05:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:05:06,023 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 17:05:06,324 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:05:06,324 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 17:05:06,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:05:06 BoogieIcfgContainer [2018-12-09 17:05:06,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:05:06,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:05:06,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:05:06,327 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:05:06,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:05:05" (1/3) ... [2018-12-09 17:05:06,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d1ef4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:05:06, skipping insertion in model container [2018-12-09 17:05:06,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:05" (2/3) ... [2018-12-09 17:05:06,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d1ef4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:05:06, skipping insertion in model container [2018-12-09 17:05:06,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:05:06" (3/3) ... [2018-12-09 17:05:06,330 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_tso.oepc_false-unreach-call.i [2018-12-09 17:05:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,354 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,354 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,358 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:05:06,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 17:05:06,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:05:06,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 17:05:06,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 17:05:06,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:05:06,400 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:05:06,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:05:06,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:05:06,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:05:06,400 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:05:06,400 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:05:06,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:05:06,406 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 17:05:07,277 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-09 17:05:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-09 17:05:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 17:05:07,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:07,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:07,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:07,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-09 17:05:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:07,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:07,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:07,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:07,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:07,453 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-09 17:05:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:07,865 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-09 17:05:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:05:07,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 17:05:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:07,994 INFO L225 Difference]: With dead ends: 45389 [2018-12-09 17:05:07,994 INFO L226 Difference]: Without dead ends: 40629 [2018-12-09 17:05:07,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-09 17:05:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-09 17:05:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 17:05:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-09 17:05:08,719 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-09 17:05:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:08,719 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-09 17:05:08,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-09 17:05:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:05:08,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:08,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:08,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:08,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-09 17:05:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:08,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:08,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:08,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-09 17:05:08,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:08,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:05:08,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:08,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:05:08,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:05:08,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:05:08,763 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-09 17:05:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:08,911 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-09 17:05:08,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:05:08,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 17:05:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:08,968 INFO L225 Difference]: With dead ends: 23663 [2018-12-09 17:05:08,968 INFO L226 Difference]: Without dead ends: 23663 [2018-12-09 17:05:08,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:05:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-09 17:05:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-09 17:05:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 17:05:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-09 17:05:09,426 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-09 17:05:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:09,427 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-09 17:05:09,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:05:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-09 17:05:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:05:09,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:09,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:09,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:09,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-09 17:05:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:09,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:09,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:09,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:09,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:09,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:09,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:09,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:09,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:09,482 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-09 17:05:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:10,060 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-09 17:05:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:05:10,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 17:05:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:10,184 INFO L225 Difference]: With dead ends: 64831 [2018-12-09 17:05:10,184 INFO L226 Difference]: Without dead ends: 64671 [2018-12-09 17:05:10,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:05:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-09 17:05:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-09 17:05:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 17:05:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-09 17:05:10,981 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-09 17:05:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:10,981 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-09 17:05:10,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-09 17:05:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 17:05:10,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:10,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:10,984 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:10,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:10,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-09 17:05:10,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:10,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:10,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:11,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:11,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:05:11,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:11,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:05:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:05:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:05:11,017 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-09 17:05:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:11,170 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-09 17:05:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:05:11,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 17:05:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:11,230 INFO L225 Difference]: With dead ends: 37143 [2018-12-09 17:05:11,230 INFO L226 Difference]: Without dead ends: 37143 [2018-12-09 17:05:11,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:05:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-09 17:05:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-09 17:05:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 17:05:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-09 17:05:11,745 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-09 17:05:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:11,745 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-09 17:05:11,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:05:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-09 17:05:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 17:05:11,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:11,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:11,748 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:11,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-09 17:05:11,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:11,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:11,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:11,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:11,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:11,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:11,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:11,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:11,900 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-09 17:05:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:12,276 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-09 17:05:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:05:12,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 17:05:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:12,390 INFO L225 Difference]: With dead ends: 66627 [2018-12-09 17:05:12,390 INFO L226 Difference]: Without dead ends: 66459 [2018-12-09 17:05:12,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:05:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-09 17:05:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-09 17:05:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-09 17:05:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-09 17:05:13,228 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-09 17:05:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:13,228 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-09 17:05:13,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-09 17:05:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 17:05:13,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:13,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:13,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-09 17:05:13,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:13,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:13,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:13,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:13,281 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-09 17:05:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:13,326 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-09 17:05:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:05:13,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 17:05:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:13,343 INFO L225 Difference]: With dead ends: 14217 [2018-12-09 17:05:13,343 INFO L226 Difference]: Without dead ends: 13696 [2018-12-09 17:05:13,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-09 17:05:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-09 17:05:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-09 17:05:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-09 17:05:13,496 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-09 17:05:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:13,496 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-09 17:05:13,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-09 17:05:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:05:13,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:13,499 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] [2018-12-09 17:05:13,499 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:13,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:13,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-09 17:05:13,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:13,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:13,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:13,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:13,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:13,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:13,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:13,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:13,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:13,550 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-09 17:05:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:13,695 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-09 17:05:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:05:13,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 17:05:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:13,717 INFO L225 Difference]: With dead ends: 19084 [2018-12-09 17:05:13,717 INFO L226 Difference]: Without dead ends: 19084 [2018-12-09 17:05:13,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-09 17:05:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-09 17:05:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-09 17:05:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-09 17:05:13,897 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-09 17:05:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:13,897 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-09 17:05:13,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-09 17:05:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:05:13,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:13,900 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] [2018-12-09 17:05:13,900 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:13,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-09 17:05:13,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:13,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:13,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:13,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:13,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:13,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:13,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:13,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:13,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:13,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:13,941 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-09 17:05:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:14,321 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-09 17:05:14,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:05:14,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 17:05:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:14,348 INFO L225 Difference]: With dead ends: 20683 [2018-12-09 17:05:14,348 INFO L226 Difference]: Without dead ends: 20683 [2018-12-09 17:05:14,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-09 17:05:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-09 17:05:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-09 17:05:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-09 17:05:14,551 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-09 17:05:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:14,551 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-09 17:05:14,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-09 17:05:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:05:14,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:14,554 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] [2018-12-09 17:05:14,554 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:14,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:14,554 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-09 17:05:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:14,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:14,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:14,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:14,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:14,595 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 5 states. [2018-12-09 17:05:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:14,621 INFO L93 Difference]: Finished difference Result 3156 states and 8362 transitions. [2018-12-09 17:05:14,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:05:14,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-09 17:05:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:14,625 INFO L225 Difference]: With dead ends: 3156 [2018-12-09 17:05:14,625 INFO L226 Difference]: Without dead ends: 2656 [2018-12-09 17:05:14,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2018-12-09 17:05:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2549. [2018-12-09 17:05:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2018-12-09 17:05:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 6737 transitions. [2018-12-09 17:05:14,650 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 6737 transitions. Word has length 59 [2018-12-09 17:05:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:14,650 INFO L480 AbstractCegarLoop]: Abstraction has 2549 states and 6737 transitions. [2018-12-09 17:05:14,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 6737 transitions. [2018-12-09 17:05:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:05:14,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:14,653 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] [2018-12-09 17:05:14,653 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:14,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:14,653 INFO L82 PathProgramCache]: Analyzing trace with hash -401390984, now seen corresponding path program 1 times [2018-12-09 17:05:14,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:14,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:14,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:14,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:14,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:14,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:14,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:14,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:14,696 INFO L87 Difference]: Start difference. First operand 2549 states and 6737 transitions. Second operand 4 states. [2018-12-09 17:05:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:14,766 INFO L93 Difference]: Finished difference Result 3071 states and 7948 transitions. [2018-12-09 17:05:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:05:14,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 17:05:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:14,768 INFO L225 Difference]: With dead ends: 3071 [2018-12-09 17:05:14,768 INFO L226 Difference]: Without dead ends: 3043 [2018-12-09 17:05:14,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2018-12-09 17:05:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2686. [2018-12-09 17:05:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2018-12-09 17:05:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 7042 transitions. [2018-12-09 17:05:14,787 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 7042 transitions. Word has length 92 [2018-12-09 17:05:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:14,787 INFO L480 AbstractCegarLoop]: Abstraction has 2686 states and 7042 transitions. [2018-12-09 17:05:14,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 7042 transitions. [2018-12-09 17:05:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:05:14,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:14,790 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] [2018-12-09 17:05:14,790 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:14,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash 568190039, now seen corresponding path program 1 times [2018-12-09 17:05:14,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:14,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:14,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:14,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:14,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:14,821 INFO L87 Difference]: Start difference. First operand 2686 states and 7042 transitions. Second operand 4 states. [2018-12-09 17:05:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:14,952 INFO L93 Difference]: Finished difference Result 3594 states and 9472 transitions. [2018-12-09 17:05:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:05:14,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 17:05:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:14,955 INFO L225 Difference]: With dead ends: 3594 [2018-12-09 17:05:14,955 INFO L226 Difference]: Without dead ends: 3594 [2018-12-09 17:05:14,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2018-12-09 17:05:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2567. [2018-12-09 17:05:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2018-12-09 17:05:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 6687 transitions. [2018-12-09 17:05:14,980 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 6687 transitions. Word has length 92 [2018-12-09 17:05:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:14,980 INFO L480 AbstractCegarLoop]: Abstraction has 2567 states and 6687 transitions. [2018-12-09 17:05:14,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 6687 transitions. [2018-12-09 17:05:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 17:05:14,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:14,982 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] [2018-12-09 17:05:14,982 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:14,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash -167652887, now seen corresponding path program 2 times [2018-12-09 17:05:14,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:14,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:14,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:15,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:15,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:15,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:15,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:15,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:15,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:15,045 INFO L87 Difference]: Start difference. First operand 2567 states and 6687 transitions. Second operand 5 states. [2018-12-09 17:05:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:15,156 INFO L93 Difference]: Finished difference Result 2957 states and 7604 transitions. [2018-12-09 17:05:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:05:15,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 17:05:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:15,159 INFO L225 Difference]: With dead ends: 2957 [2018-12-09 17:05:15,159 INFO L226 Difference]: Without dead ends: 2929 [2018-12-09 17:05:15,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:05:15,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2018-12-09 17:05:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2560. [2018-12-09 17:05:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-12-09 17:05:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 6663 transitions. [2018-12-09 17:05:15,192 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 6663 transitions. Word has length 92 [2018-12-09 17:05:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:15,192 INFO L480 AbstractCegarLoop]: Abstraction has 2560 states and 6663 transitions. [2018-12-09 17:05:15,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 6663 transitions. [2018-12-09 17:05:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:05:15,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:15,195 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] [2018-12-09 17:05:15,195 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:15,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -299900742, now seen corresponding path program 1 times [2018-12-09 17:05:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:05:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:15,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:05:15,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:15,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:05:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:05:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:15,223 INFO L87 Difference]: Start difference. First operand 2560 states and 6663 transitions. Second operand 4 states. [2018-12-09 17:05:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:15,307 INFO L93 Difference]: Finished difference Result 4731 states and 12454 transitions. [2018-12-09 17:05:15,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:05:15,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 17:05:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:15,312 INFO L225 Difference]: With dead ends: 4731 [2018-12-09 17:05:15,313 INFO L226 Difference]: Without dead ends: 4703 [2018-12-09 17:05:15,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:05:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-12-09 17:05:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 2486. [2018-12-09 17:05:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2018-12-09 17:05:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 6437 transitions. [2018-12-09 17:05:15,346 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 6437 transitions. Word has length 94 [2018-12-09 17:05:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:15,347 INFO L480 AbstractCegarLoop]: Abstraction has 2486 states and 6437 transitions. [2018-12-09 17:05:15,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:05:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 6437 transitions. [2018-12-09 17:05:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:05:15,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:15,349 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] [2018-12-09 17:05:15,349 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:15,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash 29865019, now seen corresponding path program 1 times [2018-12-09 17:05:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:15,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:15,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:05:15,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:15,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:05:15,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:05:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:05:15,400 INFO L87 Difference]: Start difference. First operand 2486 states and 6437 transitions. Second operand 6 states. [2018-12-09 17:05:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:15,609 INFO L93 Difference]: Finished difference Result 2800 states and 7054 transitions. [2018-12-09 17:05:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:05:15,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 17:05:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:15,611 INFO L225 Difference]: With dead ends: 2800 [2018-12-09 17:05:15,611 INFO L226 Difference]: Without dead ends: 2729 [2018-12-09 17:05:15,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-12-09 17:05:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2640. [2018-12-09 17:05:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2018-12-09 17:05:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 6739 transitions. [2018-12-09 17:05:15,630 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 6739 transitions. Word has length 94 [2018-12-09 17:05:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:15,630 INFO L480 AbstractCegarLoop]: Abstraction has 2640 states and 6739 transitions. [2018-12-09 17:05:15,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:05:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 6739 transitions. [2018-12-09 17:05:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:05:15,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:15,632 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] [2018-12-09 17:05:15,632 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:15,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1730605498, now seen corresponding path program 1 times [2018-12-09 17:05:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:15,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:15,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:05:15,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:15,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:05:15,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:05:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:15,698 INFO L87 Difference]: Start difference. First operand 2640 states and 6739 transitions. Second operand 7 states. [2018-12-09 17:05:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:15,838 INFO L93 Difference]: Finished difference Result 2855 states and 7275 transitions. [2018-12-09 17:05:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:05:15,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 17:05:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:15,841 INFO L225 Difference]: With dead ends: 2855 [2018-12-09 17:05:15,841 INFO L226 Difference]: Without dead ends: 2855 [2018-12-09 17:05:15,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-09 17:05:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2619. [2018-12-09 17:05:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2018-12-09 17:05:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6699 transitions. [2018-12-09 17:05:15,859 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6699 transitions. Word has length 94 [2018-12-09 17:05:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:15,859 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6699 transitions. [2018-12-09 17:05:15,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:05:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6699 transitions. [2018-12-09 17:05:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:05:15,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:15,861 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] [2018-12-09 17:05:15,861 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:15,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:15,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1153482278, now seen corresponding path program 1 times [2018-12-09 17:05:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:15,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:15,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:15,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:15,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:15,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:15,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:15,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:15,898 INFO L87 Difference]: Start difference. First operand 2619 states and 6699 transitions. Second operand 5 states. [2018-12-09 17:05:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:16,007 INFO L93 Difference]: Finished difference Result 4792 states and 12506 transitions. [2018-12-09 17:05:16,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:05:16,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 17:05:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:16,011 INFO L225 Difference]: With dead ends: 4792 [2018-12-09 17:05:16,011 INFO L226 Difference]: Without dead ends: 4766 [2018-12-09 17:05:16,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:05:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2018-12-09 17:05:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 2673. [2018-12-09 17:05:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2018-12-09 17:05:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 6822 transitions. [2018-12-09 17:05:16,038 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 6822 transitions. Word has length 94 [2018-12-09 17:05:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:16,039 INFO L480 AbstractCegarLoop]: Abstraction has 2673 states and 6822 transitions. [2018-12-09 17:05:16,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 6822 transitions. [2018-12-09 17:05:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:05:16,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:16,041 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] [2018-12-09 17:05:16,041 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:16,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash -363042151, now seen corresponding path program 1 times [2018-12-09 17:05:16,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:16,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:16,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:16,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:16,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:16,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:16,113 INFO L87 Difference]: Start difference. First operand 2673 states and 6822 transitions. Second operand 5 states. [2018-12-09 17:05:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:16,185 INFO L93 Difference]: Finished difference Result 2381 states and 6090 transitions. [2018-12-09 17:05:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:05:16,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 17:05:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:16,187 INFO L225 Difference]: With dead ends: 2381 [2018-12-09 17:05:16,188 INFO L226 Difference]: Without dead ends: 2381 [2018-12-09 17:05:16,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:05:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2018-12-09 17:05:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2293. [2018-12-09 17:05:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-09 17:05:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-09 17:05:16,203 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-09 17:05:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:16,203 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-09 17:05:16,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-09 17:05:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 17:05:16,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:16,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:16,205 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:16,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash -140505574, now seen corresponding path program 1 times [2018-12-09 17:05:16,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:05:16,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:16,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:05:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:05:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:05:16,282 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-09 17:05:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:16,329 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-09 17:05:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:05:16,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 17:05:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:16,331 INFO L225 Difference]: With dead ends: 2005 [2018-12-09 17:05:16,331 INFO L226 Difference]: Without dead ends: 2005 [2018-12-09 17:05:16,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-09 17:05:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-09 17:05:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-09 17:05:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-09 17:05:16,343 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-09 17:05:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:16,343 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-09 17:05:16,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:05:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-09 17:05:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:16,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:16,344 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] [2018-12-09 17:05:16,344 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:16,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1073631423, now seen corresponding path program 1 times [2018-12-09 17:05:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:16,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:16,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:05:16,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:16,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 17:05:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 17:05:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:05:16,417 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-09 17:05:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:16,674 INFO L93 Difference]: Finished difference Result 2961 states and 7418 transitions. [2018-12-09 17:05:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 17:05:16,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 17:05:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:16,676 INFO L225 Difference]: With dead ends: 2961 [2018-12-09 17:05:16,676 INFO L226 Difference]: Without dead ends: 2961 [2018-12-09 17:05:16,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:05:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2018-12-09 17:05:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2416. [2018-12-09 17:05:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2018-12-09 17:05:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 6124 transitions. [2018-12-09 17:05:16,695 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 6124 transitions. Word has length 96 [2018-12-09 17:05:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:16,695 INFO L480 AbstractCegarLoop]: Abstraction has 2416 states and 6124 transitions. [2018-12-09 17:05:16,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 17:05:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 6124 transitions. [2018-12-09 17:05:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:16,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:16,697 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] [2018-12-09 17:05:16,697 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:16,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-09 17:05:16,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:16,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:16,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:05:16,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:16,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:05:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:05:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:16,760 INFO L87 Difference]: Start difference. First operand 2416 states and 6124 transitions. Second operand 7 states. [2018-12-09 17:05:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:16,880 INFO L93 Difference]: Finished difference Result 2424 states and 6124 transitions. [2018-12-09 17:05:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:05:16,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 17:05:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:16,882 INFO L225 Difference]: With dead ends: 2424 [2018-12-09 17:05:16,882 INFO L226 Difference]: Without dead ends: 2424 [2018-12-09 17:05:16,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:05:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2018-12-09 17:05:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2413. [2018-12-09 17:05:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-12-09 17:05:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 6102 transitions. [2018-12-09 17:05:16,897 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 6102 transitions. Word has length 96 [2018-12-09 17:05:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:16,897 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 6102 transitions. [2018-12-09 17:05:16,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:05:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 6102 transitions. [2018-12-09 17:05:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:16,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:16,899 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] [2018-12-09 17:05:16,899 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:16,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-09 17:05:16,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:16,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:16,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:16,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:16,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:16,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:16,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:16,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:16,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:16,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:16,956 INFO L87 Difference]: Start difference. First operand 2413 states and 6102 transitions. Second operand 5 states. [2018-12-09 17:05:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:17,058 INFO L93 Difference]: Finished difference Result 2733 states and 6902 transitions. [2018-12-09 17:05:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:05:17,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 17:05:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:17,060 INFO L225 Difference]: With dead ends: 2733 [2018-12-09 17:05:17,060 INFO L226 Difference]: Without dead ends: 2733 [2018-12-09 17:05:17,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:05:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2018-12-09 17:05:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2156. [2018-12-09 17:05:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2018-12-09 17:05:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 5468 transitions. [2018-12-09 17:05:17,077 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 5468 transitions. Word has length 96 [2018-12-09 17:05:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:17,077 INFO L480 AbstractCegarLoop]: Abstraction has 2156 states and 5468 transitions. [2018-12-09 17:05:17,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 5468 transitions. [2018-12-09 17:05:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:17,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:17,079 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] [2018-12-09 17:05:17,080 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:17,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-09 17:05:17,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:17,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:17,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:05:17,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:17,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:05:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:05:17,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:05:17,174 INFO L87 Difference]: Start difference. First operand 2156 states and 5468 transitions. Second operand 10 states. [2018-12-09 17:05:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:17,437 INFO L93 Difference]: Finished difference Result 3909 states and 10132 transitions. [2018-12-09 17:05:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:05:17,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 17:05:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:17,438 INFO L225 Difference]: With dead ends: 3909 [2018-12-09 17:05:17,439 INFO L226 Difference]: Without dead ends: 1799 [2018-12-09 17:05:17,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:05:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-09 17:05:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-09 17:05:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-09 17:05:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4734 transitions. [2018-12-09 17:05:17,450 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4734 transitions. Word has length 96 [2018-12-09 17:05:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:17,450 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4734 transitions. [2018-12-09 17:05:17,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:05:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4734 transitions. [2018-12-09 17:05:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:17,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:17,452 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] [2018-12-09 17:05:17,452 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:17,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-09 17:05:17,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:05:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:17,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:17,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:05:17,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:17,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:05:17,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:05:17,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:05:17,503 INFO L87 Difference]: Start difference. First operand 1799 states and 4734 transitions. Second operand 5 states. [2018-12-09 17:05:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:17,525 INFO L93 Difference]: Finished difference Result 1799 states and 4708 transitions. [2018-12-09 17:05:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:05:17,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 17:05:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:17,527 INFO L225 Difference]: With dead ends: 1799 [2018-12-09 17:05:17,527 INFO L226 Difference]: Without dead ends: 1799 [2018-12-09 17:05:17,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:05:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-09 17:05:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-09 17:05:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-09 17:05:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-09 17:05:17,539 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-09 17:05:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:17,539 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-09 17:05:17,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:05:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-09 17:05:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:17,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:17,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:05:17,541 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:17,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-09 17:05:17,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:05:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:05:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:05:17,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:05:17,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 17:05:17,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:05:17,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 17:05:17,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 17:05:17,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:05:17,630 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-09 17:05:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:05:17,970 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-09 17:05:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 17:05:17,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-09 17:05:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:05:17,973 INFO L225 Difference]: With dead ends: 3406 [2018-12-09 17:05:17,973 INFO L226 Difference]: Without dead ends: 2430 [2018-12-09 17:05:17,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:05:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-09 17:05:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-09 17:05:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-09 17:05:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-09 17:05:17,991 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-09 17:05:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:05:17,991 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-09 17:05:17,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 17:05:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-09 17:05:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 17:05:17,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:05:17,993 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] [2018-12-09 17:05:17,993 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:05:17,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:05:17,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-09 17:05:17,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:05:17,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:05:17,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:05:17,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:05:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:05:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:05:18,032 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 17:05:18,093 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 17:05:18,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:05:18 BasicIcfg [2018-12-09 17:05:18,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:05:18,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:05:18,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:05:18,095 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:05:18,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:05:06" (3/4) ... [2018-12-09 17:05:18,097 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 17:05:18,183 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a674e628-8f2b-467e-8aff-db59da95b3e8/bin-2019/utaipan/witness.graphml [2018-12-09 17:05:18,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:05:18,183 INFO L168 Benchmark]: Toolchain (without parser) took 12588.60 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 941.6 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 17:05:18,184 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 968.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:05:18,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-09 17:05:18,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.05 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-09 17:05:18,185 INFO L168 Benchmark]: Boogie Preprocessor took 18.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:05:18,185 INFO L168 Benchmark]: RCFGBuilder took 335.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:05:18,185 INFO L168 Benchmark]: TraceAbstraction took 11769.30 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 939.9 MB in the end (delta: 84.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 17:05:18,186 INFO L168 Benchmark]: Witness Printer took 88.33 ms. Allocated memory was 2.4 GB in the beginning and 2.9 GB in the end (delta: 446.7 MB). Free memory was 939.9 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 401.4 kB. Max. memory is 11.5 GB. [2018-12-09 17:05:18,187 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 968.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.05 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 18.70 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 335.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11769.30 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 939.9 MB in the end (delta: 84.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 88.33 ms. Allocated memory was 2.4 GB in the beginning and 2.9 GB in the end (delta: 446.7 MB). Free memory was 939.9 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 401.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=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] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=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] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=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] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=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, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L765] -1 pthread_t t1103; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L766] FCALL, FORK -1 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L767] -1 pthread_t t1104; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L768] FCALL, FORK -1 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -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) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -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 [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 11.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5260 SDtfs, 4856 SDslu, 10478 SDs, 0 SdLazy, 3942 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 66 SyntacticMatches, 18 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 86694 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1962 NumberOfCodeBlocks, 1962 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 381618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...