./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_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/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_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/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-03 02:01:11,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:01:11,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:01:11,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:01:11,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:01:11,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:01:11,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:01:11,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:01:11,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:01:11,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:01:11,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:01:11,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:01:11,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:01:11,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:01:11,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:01:11,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:01:11,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:01:11,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:01:11,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:01:11,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:01:11,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:01:11,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:01:11,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:01:11,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:01:11,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:01:11,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:01:11,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:01:11,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:01:11,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:01:11,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:01:11,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:01:11,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:01:11,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:01:11,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:01:11,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:01:11,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:01:11,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:01:11,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:01:11,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:01:11,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:01:11,927 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:01:11,927 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:01:11,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:01:11,928 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:01:11,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:01:11,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:01:11,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:01:11,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:01:11,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:01:11,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:01:11,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:01:11,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:01:11,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:01:11,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:01:11,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:01:11,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:01:11,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:01:11,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:01:11,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:01:11,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:01:11,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:01:11,932 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_722d3e96-40eb-4d14-a70f-adaec6ade09a/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-03 02:01:11,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:01:11,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:01:11,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:01:11,959 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:01:11,959 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:01:11,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_tso.oepc_false-unreach-call.i [2018-12-03 02:01:11,993 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/data/06e9c25e0/efced3672de74ddca669d40d6710005f/FLAG13d438596 [2018-12-03 02:01:12,435 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:01:12,435 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/sv-benchmarks/c/pthread-wmm/mix041_tso.oepc_false-unreach-call.i [2018-12-03 02:01:12,442 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/data/06e9c25e0/efced3672de74ddca669d40d6710005f/FLAG13d438596 [2018-12-03 02:01:12,450 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/data/06e9c25e0/efced3672de74ddca669d40d6710005f [2018-12-03 02:01:12,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:01:12,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:01:12,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:01:12,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:01:12,455 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:01:12,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12, skipping insertion in model container [2018-12-03 02:01:12,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:01:12,487 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:01:12,672 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:01:12,680 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:01:12,761 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:01:12,800 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:01:12,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12 WrapperNode [2018-12-03 02:01:12,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:01:12,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:01:12,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:01:12,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:01:12,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:01:12,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:01:12,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:01:12,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:01:12,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... [2018-12-03 02:01:12,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:01:12,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:01:12,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:01:12,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:01:12,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:01:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:01:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:01:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 02:01:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:01:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 02:01:12,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 02:01:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 02:01:12,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 02:01:12,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 02:01:12,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:01:12,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:01:12,894 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 02:01:13,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:01:13,196 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 02:01:13,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:01:13 BoogieIcfgContainer [2018-12-03 02:01:13,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:01:13,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:01:13,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:01:13,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:01:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:01:12" (1/3) ... [2018-12-03 02:01:13,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2a1cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:01:13, skipping insertion in model container [2018-12-03 02:01:13,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:01:12" (2/3) ... [2018-12-03 02:01:13,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2a1cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:01:13, skipping insertion in model container [2018-12-03 02:01:13,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:01:13" (3/3) ... [2018-12-03 02:01:13,202 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_tso.oepc_false-unreach-call.i [2018-12-03 02:01:13,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,232 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,232 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:01:13,243 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 02:01:13,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:01:13,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 02:01:13,264 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 02:01:13,284 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:01:13,284 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:01:13,284 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:01:13,284 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:01:13,284 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:01:13,284 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:01:13,284 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:01:13,284 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:01:13,292 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 02:01:14,284 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-03 02:01:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-03 02:01:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 02:01:14,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:14,291 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-03 02:01:14,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:14,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-03 02:01:14,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:14,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:14,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:14,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:14,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:14,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:14,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:14,445 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-03 02:01:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:14,786 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-03 02:01:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:01:14,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-03 02:01:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:14,932 INFO L225 Difference]: With dead ends: 45389 [2018-12-03 02:01:14,933 INFO L226 Difference]: Without dead ends: 40629 [2018-12-03 02:01:14,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-03 02:01:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-03 02:01:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 02:01:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-03 02:01:15,656 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-03 02:01:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:15,657 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-03 02:01:15,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-03 02:01:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 02:01:15,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:15,659 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-03 02:01:15,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:15,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-03 02:01:15,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:15,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:15,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:15,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:15,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:01:15,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:15,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:01:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:01:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:01:15,705 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-03 02:01:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:15,875 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-03 02:01:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:01:15,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 02:01:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:15,930 INFO L225 Difference]: With dead ends: 23663 [2018-12-03 02:01:15,931 INFO L226 Difference]: Without dead ends: 23663 [2018-12-03 02:01:15,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:01:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-03 02:01:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-03 02:01:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 02:01:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-03 02:01:16,354 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-03 02:01:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:16,354 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-03 02:01:16,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:01:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-03 02:01:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 02:01:16,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:16,356 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-03 02:01:16,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:16,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-03 02:01:16,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:16,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:16,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:16,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:16,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:16,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:16,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:16,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:16,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:16,418 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-03 02:01:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:16,899 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-03 02:01:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:01:16,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 02:01:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:17,118 INFO L225 Difference]: With dead ends: 64831 [2018-12-03 02:01:17,118 INFO L226 Difference]: Without dead ends: 64671 [2018-12-03 02:01:17,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:01:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-03 02:01:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-03 02:01:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 02:01:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-03 02:01:17,811 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-03 02:01:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:17,812 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-03 02:01:17,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-03 02:01:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 02:01:17,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:17,816 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-03 02:01:17,816 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:17,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-03 02:01:17,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:17,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:17,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:17,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:17,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:17,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:17,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:01:17,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:17,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:01:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:01:17,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:01:17,853 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-03 02:01:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:18,130 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-03 02:01:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:01:18,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 02:01:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:18,186 INFO L225 Difference]: With dead ends: 37143 [2018-12-03 02:01:18,186 INFO L226 Difference]: Without dead ends: 37143 [2018-12-03 02:01:18,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:01:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-03 02:01:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-03 02:01:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 02:01:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-03 02:01:18,687 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-03 02:01:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:18,687 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-03 02:01:18,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:01:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-03 02:01:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 02:01:18,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:18,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:18,689 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:18,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-03 02:01:18,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:18,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:18,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:18,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:18,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:18,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:18,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:18,740 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-03 02:01:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:19,252 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-03 02:01:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:01:19,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 02:01:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:19,366 INFO L225 Difference]: With dead ends: 66627 [2018-12-03 02:01:19,366 INFO L226 Difference]: Without dead ends: 66459 [2018-12-03 02:01:19,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:01:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-03 02:01:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-03 02:01:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-03 02:01:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-03 02:01:20,036 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-03 02:01:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:20,036 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-03 02:01:20,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-03 02:01:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 02:01:20,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:20,043 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-03 02:01:20,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:20,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-03 02:01:20,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:20,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:20,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:20,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:20,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:20,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:20,080 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-03 02:01:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:20,123 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-03 02:01:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:01:20,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-03 02:01:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:20,140 INFO L225 Difference]: With dead ends: 14217 [2018-12-03 02:01:20,140 INFO L226 Difference]: Without dead ends: 13696 [2018-12-03 02:01:20,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-03 02:01:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-03 02:01:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-03 02:01:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-03 02:01:20,287 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-03 02:01:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:20,287 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-03 02:01:20,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-03 02:01:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:01:20,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:20,290 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-03 02:01:20,290 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:20,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-03 02:01:20,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:20,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:20,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:20,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:20,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:20,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:20,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:20,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:20,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:20,333 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-03 02:01:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:20,500 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-03 02:01:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:01:20,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 02:01:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:20,526 INFO L225 Difference]: With dead ends: 19084 [2018-12-03 02:01:20,526 INFO L226 Difference]: Without dead ends: 19084 [2018-12-03 02:01:20,527 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-03 02:01:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-03 02:01:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-03 02:01:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-03 02:01:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-03 02:01:20,719 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-03 02:01:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:20,719 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-03 02:01:20,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-03 02:01:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:01:20,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:20,722 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:20,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-03 02:01:20,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:20,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:20,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:20,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:20,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:20,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:20,789 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-03 02:01:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:21,188 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-03 02:01:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:01:21,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 02:01:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:21,210 INFO L225 Difference]: With dead ends: 20683 [2018-12-03 02:01:21,210 INFO L226 Difference]: Without dead ends: 20683 [2018-12-03 02:01:21,211 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-03 02:01:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-03 02:01:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-03 02:01:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-03 02:01:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-03 02:01:21,405 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-03 02:01:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:21,405 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-03 02:01:21,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-03 02:01:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:01:21,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:21,409 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-03 02:01:21,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:21,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-03 02:01:21,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:21,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:21,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:21,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:21,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:21,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:21,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:21,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:21,452 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 5 states. [2018-12-03 02:01:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:21,473 INFO L93 Difference]: Finished difference Result 3156 states and 8362 transitions. [2018-12-03 02:01:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:01:21,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-03 02:01:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:21,475 INFO L225 Difference]: With dead ends: 3156 [2018-12-03 02:01:21,475 INFO L226 Difference]: Without dead ends: 2656 [2018-12-03 02:01:21,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:01:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2018-12-03 02:01:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2549. [2018-12-03 02:01:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2018-12-03 02:01:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 6737 transitions. [2018-12-03 02:01:21,493 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 6737 transitions. Word has length 59 [2018-12-03 02:01:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:21,493 INFO L480 AbstractCegarLoop]: Abstraction has 2549 states and 6737 transitions. [2018-12-03 02:01:21,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 6737 transitions. [2018-12-03 02:01:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 02:01:21,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:21,495 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-03 02:01:21,495 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:21,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1291396420, now seen corresponding path program 1 times [2018-12-03 02:01:21,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:21,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:21,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:21,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:21,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:21,536 INFO L87 Difference]: Start difference. First operand 2549 states and 6737 transitions. Second operand 4 states. [2018-12-03 02:01:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:21,609 INFO L93 Difference]: Finished difference Result 3071 states and 7948 transitions. [2018-12-03 02:01:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:01:21,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-03 02:01:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:21,611 INFO L225 Difference]: With dead ends: 3071 [2018-12-03 02:01:21,611 INFO L226 Difference]: Without dead ends: 3043 [2018-12-03 02:01:21,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2018-12-03 02:01:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2686. [2018-12-03 02:01:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2018-12-03 02:01:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 7042 transitions. [2018-12-03 02:01:21,631 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 7042 transitions. Word has length 92 [2018-12-03 02:01:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:21,631 INFO L480 AbstractCegarLoop]: Abstraction has 2686 states and 7042 transitions. [2018-12-03 02:01:21,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 7042 transitions. [2018-12-03 02:01:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 02:01:21,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:21,635 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-03 02:01:21,635 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:21,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2033989853, now seen corresponding path program 1 times [2018-12-03 02:01:21,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:21,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:21,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:21,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:21,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:21,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:21,680 INFO L87 Difference]: Start difference. First operand 2686 states and 7042 transitions. Second operand 4 states. [2018-12-03 02:01:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:21,814 INFO L93 Difference]: Finished difference Result 3594 states and 9472 transitions. [2018-12-03 02:01:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:01:21,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-03 02:01:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:21,817 INFO L225 Difference]: With dead ends: 3594 [2018-12-03 02:01:21,818 INFO L226 Difference]: Without dead ends: 3594 [2018-12-03 02:01:21,818 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-03 02:01:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2018-12-03 02:01:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2567. [2018-12-03 02:01:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2018-12-03 02:01:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 6687 transitions. [2018-12-03 02:01:21,838 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 6687 transitions. Word has length 92 [2018-12-03 02:01:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:21,838 INFO L480 AbstractCegarLoop]: Abstraction has 2567 states and 6687 transitions. [2018-12-03 02:01:21,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 6687 transitions. [2018-12-03 02:01:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 02:01:21,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:21,840 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-03 02:01:21,841 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:21,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1525134517, now seen corresponding path program 2 times [2018-12-03 02:01:21,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:21,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:21,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:21,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:21,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:21,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:21,908 INFO L87 Difference]: Start difference. First operand 2567 states and 6687 transitions. Second operand 5 states. [2018-12-03 02:01:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:22,037 INFO L93 Difference]: Finished difference Result 2957 states and 7604 transitions. [2018-12-03 02:01:22,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:01:22,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-03 02:01:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:22,040 INFO L225 Difference]: With dead ends: 2957 [2018-12-03 02:01:22,040 INFO L226 Difference]: Without dead ends: 2929 [2018-12-03 02:01:22,040 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-03 02:01:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2018-12-03 02:01:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2560. [2018-12-03 02:01:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-12-03 02:01:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 6663 transitions. [2018-12-03 02:01:22,058 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 6663 transitions. Word has length 92 [2018-12-03 02:01:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:22,059 INFO L480 AbstractCegarLoop]: Abstraction has 2560 states and 6663 transitions. [2018-12-03 02:01:22,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 6663 transitions. [2018-12-03 02:01:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:01:22,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:22,061 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-03 02:01:22,062 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:22,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1392886662, now seen corresponding path program 1 times [2018-12-03 02:01:22,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:22,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:01:22,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:01:22,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:01:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:01:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:01:22,100 INFO L87 Difference]: Start difference. First operand 2560 states and 6663 transitions. Second operand 4 states. [2018-12-03 02:01:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:22,177 INFO L93 Difference]: Finished difference Result 4731 states and 12454 transitions. [2018-12-03 02:01:22,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:01:22,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 02:01:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:22,181 INFO L225 Difference]: With dead ends: 4731 [2018-12-03 02:01:22,181 INFO L226 Difference]: Without dead ends: 4703 [2018-12-03 02:01:22,181 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-03 02:01:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-12-03 02:01:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 2486. [2018-12-03 02:01:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2018-12-03 02:01:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 6437 transitions. [2018-12-03 02:01:22,204 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 6437 transitions. Word has length 94 [2018-12-03 02:01:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:22,204 INFO L480 AbstractCegarLoop]: Abstraction has 2486 states and 6437 transitions. [2018-12-03 02:01:22,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:01:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 6437 transitions. [2018-12-03 02:01:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:01:22,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:22,207 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-03 02:01:22,207 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:22,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1440500635, now seen corresponding path program 1 times [2018-12-03 02:01:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:22,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:22,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:01:22,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:22,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:01:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:01:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:01:22,251 INFO L87 Difference]: Start difference. First operand 2486 states and 6437 transitions. Second operand 6 states. [2018-12-03 02:01:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:22,453 INFO L93 Difference]: Finished difference Result 2800 states and 7054 transitions. [2018-12-03 02:01:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:01:22,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 02:01:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:22,455 INFO L225 Difference]: With dead ends: 2800 [2018-12-03 02:01:22,455 INFO L226 Difference]: Without dead ends: 2729 [2018-12-03 02:01:22,456 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-03 02:01:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-12-03 02:01:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2640. [2018-12-03 02:01:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2018-12-03 02:01:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 6739 transitions. [2018-12-03 02:01:22,473 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 6739 transitions. Word has length 94 [2018-12-03 02:01:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:22,473 INFO L480 AbstractCegarLoop]: Abstraction has 2640 states and 6739 transitions. [2018-12-03 02:01:22,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:01:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 6739 transitions. [2018-12-03 02:01:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:01:22,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:22,475 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-03 02:01:22,475 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:22,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash 260239844, now seen corresponding path program 1 times [2018-12-03 02:01:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:22,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:01:22,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:22,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:01:22,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:01:22,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:01:22,537 INFO L87 Difference]: Start difference. First operand 2640 states and 6739 transitions. Second operand 7 states. [2018-12-03 02:01:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:22,682 INFO L93 Difference]: Finished difference Result 2855 states and 7275 transitions. [2018-12-03 02:01:22,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:01:22,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 02:01:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:22,684 INFO L225 Difference]: With dead ends: 2855 [2018-12-03 02:01:22,684 INFO L226 Difference]: Without dead ends: 2855 [2018-12-03 02:01:22,685 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-03 02:01:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-03 02:01:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2619. [2018-12-03 02:01:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2018-12-03 02:01:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6699 transitions. [2018-12-03 02:01:22,703 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6699 transitions. Word has length 94 [2018-12-03 02:01:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:22,703 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6699 transitions. [2018-12-03 02:01:22,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:01:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6699 transitions. [2018-12-03 02:01:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:01:22,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:22,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:22,705 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:22,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1671119364, now seen corresponding path program 1 times [2018-12-03 02:01:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:22,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:22,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:22,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:22,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:22,773 INFO L87 Difference]: Start difference. First operand 2619 states and 6699 transitions. Second operand 5 states. [2018-12-03 02:01:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:22,843 INFO L93 Difference]: Finished difference Result 2345 states and 6011 transitions. [2018-12-03 02:01:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:01:22,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 02:01:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:22,845 INFO L225 Difference]: With dead ends: 2345 [2018-12-03 02:01:22,846 INFO L226 Difference]: Without dead ends: 2345 [2018-12-03 02:01:22,846 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-03 02:01:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2018-12-03 02:01:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2257. [2018-12-03 02:01:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-12-03 02:01:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5828 transitions. [2018-12-03 02:01:22,862 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5828 transitions. Word has length 94 [2018-12-03 02:01:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:22,862 INFO L480 AbstractCegarLoop]: Abstraction has 2257 states and 5828 transitions. [2018-12-03 02:01:22,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5828 transitions. [2018-12-03 02:01:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:01:22,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:22,864 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-03 02:01:22,864 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:22,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2076165861, now seen corresponding path program 1 times [2018-12-03 02:01:22,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:22,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:22,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:22,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:22,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:22,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:22,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:22,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:22,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:22,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:22,894 INFO L87 Difference]: Start difference. First operand 2257 states and 5828 transitions. Second operand 5 states. [2018-12-03 02:01:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:22,998 INFO L93 Difference]: Finished difference Result 4039 states and 10710 transitions. [2018-12-03 02:01:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:01:22,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 02:01:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:23,001 INFO L225 Difference]: With dead ends: 4039 [2018-12-03 02:01:23,001 INFO L226 Difference]: Without dead ends: 4039 [2018-12-03 02:01:23,001 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-03 02:01:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2018-12-03 02:01:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2293. [2018-12-03 02:01:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-03 02:01:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-03 02:01:23,022 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-03 02:01:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:23,022 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-03 02:01:23,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-03 02:01:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:01:23,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:23,024 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-03 02:01:23,024 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:23,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash -140505574, now seen corresponding path program 1 times [2018-12-03 02:01:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:23,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:23,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:01:23,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:23,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:01:23,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:01:23,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:01:23,098 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-03 02:01:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:23,153 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-03 02:01:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:01:23,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 02:01:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:23,156 INFO L225 Difference]: With dead ends: 2005 [2018-12-03 02:01:23,156 INFO L226 Difference]: Without dead ends: 2005 [2018-12-03 02:01:23,156 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-03 02:01:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-03 02:01:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-03 02:01:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-03 02:01:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-03 02:01:23,170 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-03 02:01:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:23,170 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-03 02:01:23,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:01:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-03 02:01:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:23,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:23,172 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-03 02:01:23,172 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:23,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1073631423, now seen corresponding path program 1 times [2018-12-03 02:01:23,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:23,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:23,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:23,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:01:23,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:23,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:01:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:01:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:01:23,244 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-03 02:01:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:23,477 INFO L93 Difference]: Finished difference Result 2961 states and 7418 transitions. [2018-12-03 02:01:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:01:23,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-03 02:01:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:23,481 INFO L225 Difference]: With dead ends: 2961 [2018-12-03 02:01:23,481 INFO L226 Difference]: Without dead ends: 2961 [2018-12-03 02:01:23,481 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-03 02:01:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2018-12-03 02:01:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2416. [2018-12-03 02:01:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2018-12-03 02:01:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 6124 transitions. [2018-12-03 02:01:23,507 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 6124 transitions. Word has length 96 [2018-12-03 02:01:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:23,507 INFO L480 AbstractCegarLoop]: Abstraction has 2416 states and 6124 transitions. [2018-12-03 02:01:23,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:01:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 6124 transitions. [2018-12-03 02:01:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:23,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:23,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:01:23,509 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:23,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-03 02:01:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:23,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:23,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:23,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:23,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:01:23,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:23,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:01:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:01:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:01:23,588 INFO L87 Difference]: Start difference. First operand 2416 states and 6124 transitions. Second operand 7 states. [2018-12-03 02:01:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:23,706 INFO L93 Difference]: Finished difference Result 2424 states and 6124 transitions. [2018-12-03 02:01:23,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:01:23,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 02:01:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:23,709 INFO L225 Difference]: With dead ends: 2424 [2018-12-03 02:01:23,709 INFO L226 Difference]: Without dead ends: 2424 [2018-12-03 02:01:23,709 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-03 02:01:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2018-12-03 02:01:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2413. [2018-12-03 02:01:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-12-03 02:01:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 6102 transitions. [2018-12-03 02:01:23,724 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 6102 transitions. Word has length 96 [2018-12-03 02:01:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:23,724 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 6102 transitions. [2018-12-03 02:01:23,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:01:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 6102 transitions. [2018-12-03 02:01:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:23,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:23,727 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-03 02:01:23,727 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:23,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-03 02:01:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:23,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:23,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:23,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:23,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:23,785 INFO L87 Difference]: Start difference. First operand 2413 states and 6102 transitions. Second operand 5 states. [2018-12-03 02:01:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:23,878 INFO L93 Difference]: Finished difference Result 2733 states and 6902 transitions. [2018-12-03 02:01:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:01:23,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 02:01:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:23,881 INFO L225 Difference]: With dead ends: 2733 [2018-12-03 02:01:23,881 INFO L226 Difference]: Without dead ends: 2733 [2018-12-03 02:01:23,881 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-03 02:01:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2018-12-03 02:01:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2156. [2018-12-03 02:01:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2018-12-03 02:01:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 5468 transitions. [2018-12-03 02:01:23,896 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 5468 transitions. Word has length 96 [2018-12-03 02:01:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:23,896 INFO L480 AbstractCegarLoop]: Abstraction has 2156 states and 5468 transitions. [2018-12-03 02:01:23,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 5468 transitions. [2018-12-03 02:01:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:23,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:23,898 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-03 02:01:23,898 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:23,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-03 02:01:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:23,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:23,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:23,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:23,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:23,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:01:23,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:23,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:01:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:01:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:01:23,986 INFO L87 Difference]: Start difference. First operand 2156 states and 5468 transitions. Second operand 10 states. [2018-12-03 02:01:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:24,270 INFO L93 Difference]: Finished difference Result 3909 states and 10132 transitions. [2018-12-03 02:01:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:01:24,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 02:01:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:24,273 INFO L225 Difference]: With dead ends: 3909 [2018-12-03 02:01:24,273 INFO L226 Difference]: Without dead ends: 1799 [2018-12-03 02:01:24,273 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-03 02:01:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-03 02:01:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-03 02:01:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-03 02:01:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4734 transitions. [2018-12-03 02:01:24,292 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4734 transitions. Word has length 96 [2018-12-03 02:01:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:24,292 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4734 transitions. [2018-12-03 02:01:24,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:01:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4734 transitions. [2018-12-03 02:01:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:24,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:24,294 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-03 02:01:24,295 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:24,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-03 02:01:24,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:24,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:01:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:24,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:24,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:24,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:01:24,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:24,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:01:24,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:01:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:01:24,360 INFO L87 Difference]: Start difference. First operand 1799 states and 4734 transitions. Second operand 5 states. [2018-12-03 02:01:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:24,385 INFO L93 Difference]: Finished difference Result 1799 states and 4708 transitions. [2018-12-03 02:01:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:01:24,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 02:01:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:24,388 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 02:01:24,388 INFO L226 Difference]: Without dead ends: 1799 [2018-12-03 02:01:24,388 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-03 02:01:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-03 02:01:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-03 02:01:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-03 02:01:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-03 02:01:24,407 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-03 02:01:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:24,407 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-03 02:01:24,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:01:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-03 02:01:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:24,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:24,409 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-03 02:01:24,410 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:24,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-03 02:01:24,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:24,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:01:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:24,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:01:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:01:24,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:01:24,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:01:24,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:01:24,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:01:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:01:24,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:01:24,510 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-03 02:01:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:01:24,865 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-03 02:01:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 02:01:24,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-03 02:01:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:01:24,867 INFO L225 Difference]: With dead ends: 3406 [2018-12-03 02:01:24,867 INFO L226 Difference]: Without dead ends: 2430 [2018-12-03 02:01:24,868 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-03 02:01:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-03 02:01:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-03 02:01:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-03 02:01:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-03 02:01:24,884 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-03 02:01:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:01:24,885 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-03 02:01:24,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:01:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-03 02:01:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:01:24,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:01:24,886 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-03 02:01:24,887 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:01:24,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:01:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-03 02:01:24,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:01:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:24,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:01:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:01:24,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:01:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:01:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:01:24,937 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:01:25,004 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 02:01:25,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:01:25 BasicIcfg [2018-12-03 02:01:25,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:01:25,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:01:25,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:01:25,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:01:25,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:01:13" (3/4) ... [2018-12-03 02:01:25,008 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 02:01:25,074 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_722d3e96-40eb-4d14-a70f-adaec6ade09a/bin-2019/utaipan/witness.graphml [2018-12-03 02:01:25,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:01:25,074 INFO L168 Benchmark]: Toolchain (without parser) took 12622.64 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 956.0 MB in the beginning and 2.0 GB in the end (delta: -997.3 MB). Peak memory consumption was 774.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:25,075 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:01:25,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -108.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:25,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.15 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:25,076 INFO L168 Benchmark]: Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:01:25,076 INFO L168 Benchmark]: RCFGBuilder took 337.96 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:25,076 INFO L168 Benchmark]: TraceAbstraction took 11808.70 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -983.7 MB). Peak memory consumption was 698.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:25,077 INFO L168 Benchmark]: Witness Printer took 68.06 ms. Allocated memory is still 2.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:01:25,078 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -108.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.15 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.34 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 337.96 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11808.70 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -983.7 MB). Peak memory consumption was 698.8 MB. Max. memory is 11.5 GB. * Witness Printer took 68.06 ms. Allocated memory is still 2.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [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.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5254 SDtfs, 5081 SDslu, 10222 SDs, 0 SdLazy, 3848 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 66 SyntacticMatches, 18 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s 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: 3.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 86347 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1962 NumberOfCodeBlocks, 1962 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 379014 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...