./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_rmo.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_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/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 d09e5902c3e47c1de0260aa103bb8e06a6e05e27 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 03:07:55,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:07:55,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:07:55,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:07:55,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:07:55,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:07:55,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:07:55,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:07:55,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:07:55,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:07:55,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:07:55,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:07:55,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:07:55,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:07:55,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:07:55,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:07:55,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:07:55,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:07:55,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:07:55,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:07:55,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:07:55,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:07:55,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:07:55,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:07:55,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:07:55,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:07:55,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:07:55,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:07:55,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:07:55,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:07:55,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:07:55,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:07:55,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:07:55,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:07:55,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:07:55,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:07:55,980 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 03:07:55,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:07:55,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:07:55,988 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:07:55,988 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 03:07:55,988 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:07:55,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:07:55,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:07:55,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:07:55,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 03:07:55,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:07:55,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 03:07:55,991 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 03:07:55,991 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_e1f628e0-28df-4a1e-9601-399107449b50/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 -> d09e5902c3e47c1de0260aa103bb8e06a6e05e27 [2018-12-09 03:07:56,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:07:56,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:07:56,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:07:56,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:07:56,017 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:07:56,018 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-12-09 03:07:56,053 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/data/1ec1103a6/9ffdc6d60d9a4ca780ffbc31d209937f/FLAG483b6efa5 [2018-12-09 03:07:56,495 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:07:56,496 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-12-09 03:07:56,504 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/data/1ec1103a6/9ffdc6d60d9a4ca780ffbc31d209937f/FLAG483b6efa5 [2018-12-09 03:07:56,512 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/data/1ec1103a6/9ffdc6d60d9a4ca780ffbc31d209937f [2018-12-09 03:07:56,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:07:56,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:07:56,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:07:56,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:07:56,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:07:56,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56, skipping insertion in model container [2018-12-09 03:07:56,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:07:56,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:07:56,726 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:07:56,734 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:07:56,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:07:56,838 INFO L195 MainTranslator]: Completed translation [2018-12-09 03:07:56,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56 WrapperNode [2018-12-09 03:07:56,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 03:07:56,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 03:07:56,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 03:07:56,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 03:07:56,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 03:07:56,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 03:07:56,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 03:07:56,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 03:07:56,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... [2018-12-09 03:07:56,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 03:07:56,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 03:07:56,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 03:07:56,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 03:07:56,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:07:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 03:07:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 03:07:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 03:07:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 03:07:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 03:07:56,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 03:07:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 03:07:56,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 03:07:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 03:07:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 03:07:56,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 03:07:56,925 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 03:07:57,253 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 03:07:57,253 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 03:07:57,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:57 BoogieIcfgContainer [2018-12-09 03:07:57,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 03:07:57,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 03:07:57,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 03:07:57,256 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 03:07:57,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:07:56" (1/3) ... [2018-12-09 03:07:57,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b938d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:07:57, skipping insertion in model container [2018-12-09 03:07:57,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:56" (2/3) ... [2018-12-09 03:07:57,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b938d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:07:57, skipping insertion in model container [2018-12-09 03:07:57,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:57" (3/3) ... [2018-12-09 03:07:57,259 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc_false-unreach-call.i [2018-12-09 03:07:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,285 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,285 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,292 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,292 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 03:07:57,310 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 03:07:57,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 03:07:57,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 03:07:57,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 03:07:57,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 03:07:57,339 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 03:07:57,339 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 03:07:57,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 03:07:57,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 03:07:57,339 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 03:07:57,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 03:07:57,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 03:07:57,345 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-09 03:07:58,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-09 03:07:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-09 03:07:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 03:07:58,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:58,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] [2018-12-09 03:07:58,706 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:58,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-09 03:07:58,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:58,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:58,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:07:58,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:58,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:58,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:58,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:58,871 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-09 03:07:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:59,356 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-09 03:07:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:59,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-09 03:07:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:59,512 INFO L225 Difference]: With dead ends: 60793 [2018-12-09 03:07:59,513 INFO L226 Difference]: Without dead ends: 44273 [2018-12-09 03:07:59,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-09 03:08:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-09 03:08:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-09 03:08:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-09 03:08:00,227 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-09 03:08:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:00,228 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-09 03:08:00,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-09 03:08:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 03:08:00,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:00,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:00,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:00,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-09 03:08:00,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:00,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:00,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:00,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:00,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:00,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:00,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:00,285 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-12-09 03:08:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:00,351 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-12-09 03:08:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:08:00,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 03:08:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:00,366 INFO L225 Difference]: With dead ends: 8531 [2018-12-09 03:08:00,366 INFO L226 Difference]: Without dead ends: 7469 [2018-12-09 03:08:00,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-09 03:08:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-12-09 03:08:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-12-09 03:08:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-12-09 03:08:00,450 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-12-09 03:08:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:00,451 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-12-09 03:08:00,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-12-09 03:08:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 03:08:00,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:00,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:00,452 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:00,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-09 03:08:00,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:00,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:00,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:00,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:00,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:00,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:00,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:00,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:00,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:00,499 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-12-09 03:08:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:00,705 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-12-09 03:08:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:00,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-09 03:08:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:00,727 INFO L225 Difference]: With dead ends: 14001 [2018-12-09 03:08:00,727 INFO L226 Difference]: Without dead ends: 13933 [2018-12-09 03:08:00,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-12-09 03:08:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-12-09 03:08:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-12-09 03:08:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-12-09 03:08:00,899 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-12-09 03:08:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:00,900 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-12-09 03:08:00,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-12-09 03:08:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 03:08:00,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:00,901 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] [2018-12-09 03:08:00,901 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:00,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-09 03:08:00,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:00,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:00,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:00,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:00,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:00,932 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-12-09 03:08:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:00,978 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-12-09 03:08:00,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:00,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-09 03:08:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:00,994 INFO L225 Difference]: With dead ends: 13282 [2018-12-09 03:08:00,994 INFO L226 Difference]: Without dead ends: 13282 [2018-12-09 03:08:00,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-12-09 03:08:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-12-09 03:08:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-12-09 03:08:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-12-09 03:08:01,109 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-12-09 03:08:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:01,110 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-12-09 03:08:01,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-12-09 03:08:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 03:08:01,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:01,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:01,111 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:01,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-09 03:08:01,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:01,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:01,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:01,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:01,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:01,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:01,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:01,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:01,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:01,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:01,162 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-12-09 03:08:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:01,401 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-12-09 03:08:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 03:08:01,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-09 03:08:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:01,417 INFO L225 Difference]: With dead ends: 14206 [2018-12-09 03:08:01,417 INFO L226 Difference]: Without dead ends: 14134 [2018-12-09 03:08:01,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 03:08:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-12-09 03:08:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-12-09 03:08:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-12-09 03:08:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-12-09 03:08:01,539 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-12-09 03:08:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:01,539 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-12-09 03:08:01,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-12-09 03:08:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 03:08:01,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:01,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:01,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:01,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-09 03:08:01,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:01,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:01,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:01,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:01,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:01,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:01,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:01,588 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-12-09 03:08:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:01,709 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-12-09 03:08:01,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:08:01,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 03:08:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:01,723 INFO L225 Difference]: With dead ends: 12399 [2018-12-09 03:08:01,723 INFO L226 Difference]: Without dead ends: 12399 [2018-12-09 03:08:01,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-12-09 03:08:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-12-09 03:08:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-12-09 03:08:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-12-09 03:08:01,839 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-12-09 03:08:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:01,839 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-12-09 03:08:01,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-12-09 03:08:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 03:08:01,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:01,842 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] [2018-12-09 03:08:01,842 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:01,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-09 03:08:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:01,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:01,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:01,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:01,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:01,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:01,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:01,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:01,890 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-12-09 03:08:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:02,179 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-12-09 03:08:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 03:08:02,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 03:08:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:02,202 INFO L225 Difference]: With dead ends: 20972 [2018-12-09 03:08:02,202 INFO L226 Difference]: Without dead ends: 20901 [2018-12-09 03:08:02,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:08:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-12-09 03:08:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-12-09 03:08:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-12-09 03:08:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-12-09 03:08:02,379 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-12-09 03:08:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:02,379 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-12-09 03:08:02,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-12-09 03:08:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:08:02,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:02,383 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] [2018-12-09 03:08:02,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:02,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 109789944, now seen corresponding path program 1 times [2018-12-09 03:08:02,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:02,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:02,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:02,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:02,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:02,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:02,422 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-12-09 03:08:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:02,642 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-12-09 03:08:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:02,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 03:08:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:02,664 INFO L225 Difference]: With dead ends: 19950 [2018-12-09 03:08:02,664 INFO L226 Difference]: Without dead ends: 19950 [2018-12-09 03:08:02,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-12-09 03:08:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-12-09 03:08:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-12-09 03:08:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-12-09 03:08:02,881 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-12-09 03:08:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:02,881 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-12-09 03:08:02,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-12-09 03:08:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:08:02,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:02,885 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] [2018-12-09 03:08:02,885 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:02,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1697664519, now seen corresponding path program 1 times [2018-12-09 03:08:02,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:02,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:02,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:02,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:02,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:02,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:02,941 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-12-09 03:08:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:03,205 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-12-09 03:08:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:03,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 03:08:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:03,229 INFO L225 Difference]: With dead ends: 22122 [2018-12-09 03:08:03,230 INFO L226 Difference]: Without dead ends: 22122 [2018-12-09 03:08:03,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-12-09 03:08:03,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-12-09 03:08:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-12-09 03:08:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-12-09 03:08:03,441 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-12-09 03:08:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:03,441 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-12-09 03:08:03,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-12-09 03:08:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 03:08:03,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:03,446 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] [2018-12-09 03:08:03,446 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:03,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash 520093434, now seen corresponding path program 1 times [2018-12-09 03:08:03,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:03,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:03,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:03,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:03,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:03,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:03,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:03,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:03,468 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-12-09 03:08:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:03,621 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-12-09 03:08:03,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:03,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 03:08:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:03,644 INFO L225 Difference]: With dead ends: 20728 [2018-12-09 03:08:03,644 INFO L226 Difference]: Without dead ends: 20728 [2018-12-09 03:08:03,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-12-09 03:08:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-12-09 03:08:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-12-09 03:08:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-12-09 03:08:03,843 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-12-09 03:08:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:03,843 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-12-09 03:08:03,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-12-09 03:08:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:03,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:03,849 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] [2018-12-09 03:08:03,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:03,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash -981974209, now seen corresponding path program 1 times [2018-12-09 03:08:03,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:03,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:03,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:03,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:03,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:03,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:03,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:03,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:03,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:03,870 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-12-09 03:08:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:04,001 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-12-09 03:08:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:04,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 03:08:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:04,031 INFO L225 Difference]: With dead ends: 25692 [2018-12-09 03:08:04,031 INFO L226 Difference]: Without dead ends: 25692 [2018-12-09 03:08:04,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-12-09 03:08:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-12-09 03:08:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-12-09 03:08:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-12-09 03:08:04,314 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-12-09 03:08:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:04,315 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-12-09 03:08:04,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-12-09 03:08:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:04,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:04,322 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] [2018-12-09 03:08:04,322 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:04,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 814977150, now seen corresponding path program 1 times [2018-12-09 03:08:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:04,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:04,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:04,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:04,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:04,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:04,377 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-12-09 03:08:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:04,925 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-12-09 03:08:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:04,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 03:08:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:04,964 INFO L225 Difference]: With dead ends: 29944 [2018-12-09 03:08:04,964 INFO L226 Difference]: Without dead ends: 29944 [2018-12-09 03:08:04,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-12-09 03:08:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-12-09 03:08:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-12-09 03:08:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-12-09 03:08:05,264 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-12-09 03:08:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:05,264 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-12-09 03:08:05,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-12-09 03:08:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:05,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:05,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:05,273 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:05,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1262232193, now seen corresponding path program 1 times [2018-12-09 03:08:05,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:05,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:05,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:05,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:05,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:05,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:05,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:05,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:05,339 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-12-09 03:08:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:05,641 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-12-09 03:08:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:08:05,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 03:08:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:05,680 INFO L225 Difference]: With dead ends: 32012 [2018-12-09 03:08:05,680 INFO L226 Difference]: Without dead ends: 32012 [2018-12-09 03:08:05,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:08:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-12-09 03:08:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-12-09 03:08:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-12-09 03:08:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-12-09 03:08:06,042 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-12-09 03:08:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:06,042 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-12-09 03:08:06,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-12-09 03:08:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:06,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:06,053 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] [2018-12-09 03:08:06,053 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:06,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:06,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1050881280, now seen corresponding path program 1 times [2018-12-09 03:08:06,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:06,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:06,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:06,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:06,110 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-12-09 03:08:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:06,388 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-12-09 03:08:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:06,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 03:08:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:06,428 INFO L225 Difference]: With dead ends: 35071 [2018-12-09 03:08:06,428 INFO L226 Difference]: Without dead ends: 35071 [2018-12-09 03:08:06,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-12-09 03:08:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-12-09 03:08:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-12-09 03:08:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-12-09 03:08:06,765 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-12-09 03:08:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:06,765 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-12-09 03:08:06,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-12-09 03:08:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:06,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:06,773 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] [2018-12-09 03:08:06,773 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:06,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash 936600480, now seen corresponding path program 1 times [2018-12-09 03:08:06,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:06,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:06,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:06,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:06,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:06,804 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-12-09 03:08:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:07,012 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-12-09 03:08:07,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:07,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 03:08:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:07,058 INFO L225 Difference]: With dead ends: 42528 [2018-12-09 03:08:07,059 INFO L226 Difference]: Without dead ends: 42528 [2018-12-09 03:08:07,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-12-09 03:08:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-12-09 03:08:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-12-09 03:08:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-12-09 03:08:07,452 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-12-09 03:08:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:07,452 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-12-09 03:08:07,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-12-09 03:08:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:07,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:07,462 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] [2018-12-09 03:08:07,462 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:07,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash -870853983, now seen corresponding path program 1 times [2018-12-09 03:08:07,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:07,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:07,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:07,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:07,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:07,501 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 5 states. [2018-12-09 03:08:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:07,546 INFO L93 Difference]: Finished difference Result 7904 states and 19093 transitions. [2018-12-09 03:08:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:08:07,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 03:08:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:07,553 INFO L225 Difference]: With dead ends: 7904 [2018-12-09 03:08:07,553 INFO L226 Difference]: Without dead ends: 6422 [2018-12-09 03:08:07,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2018-12-09 03:08:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 5770. [2018-12-09 03:08:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5770 states. [2018-12-09 03:08:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 13511 transitions. [2018-12-09 03:08:07,609 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 13511 transitions. Word has length 69 [2018-12-09 03:08:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:07,609 INFO L480 AbstractCegarLoop]: Abstraction has 5770 states and 13511 transitions. [2018-12-09 03:08:07,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 13511 transitions. [2018-12-09 03:08:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 03:08:07,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:07,612 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] [2018-12-09 03:08:07,612 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:07,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-09 03:08:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:07,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:07,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:08:07,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:07,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:08:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:08:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:07,632 INFO L87 Difference]: Start difference. First operand 5770 states and 13511 transitions. Second operand 3 states. [2018-12-09 03:08:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:07,661 INFO L93 Difference]: Finished difference Result 7636 states and 17741 transitions. [2018-12-09 03:08:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:08:07,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 03:08:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:07,666 INFO L225 Difference]: With dead ends: 7636 [2018-12-09 03:08:07,666 INFO L226 Difference]: Without dead ends: 7636 [2018-12-09 03:08:07,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:08:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2018-12-09 03:08:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 5709. [2018-12-09 03:08:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-12-09 03:08:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 13051 transitions. [2018-12-09 03:08:07,719 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 13051 transitions. Word has length 69 [2018-12-09 03:08:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:07,719 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 13051 transitions. [2018-12-09 03:08:07,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:08:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 13051 transitions. [2018-12-09 03:08:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 03:08:07,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:07,723 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] [2018-12-09 03:08:07,723 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:07,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-09 03:08:07,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:07,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:07,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:07,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:07,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:07,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:07,760 INFO L87 Difference]: Start difference. First operand 5709 states and 13051 transitions. Second operand 5 states. [2018-12-09 03:08:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:07,891 INFO L93 Difference]: Finished difference Result 6873 states and 15675 transitions. [2018-12-09 03:08:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:08:07,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-09 03:08:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:07,896 INFO L225 Difference]: With dead ends: 6873 [2018-12-09 03:08:07,896 INFO L226 Difference]: Without dead ends: 6873 [2018-12-09 03:08:07,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:08:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2018-12-09 03:08:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 6153. [2018-12-09 03:08:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-12-09 03:08:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 14055 transitions. [2018-12-09 03:08:07,941 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 14055 transitions. Word has length 75 [2018-12-09 03:08:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:07,941 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 14055 transitions. [2018-12-09 03:08:07,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 14055 transitions. [2018-12-09 03:08:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 03:08:07,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:07,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:07,944 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:07,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-09 03:08:07,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:07,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:07,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:07,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:07,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:07,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:07,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:07,985 INFO L87 Difference]: Start difference. First operand 6153 states and 14055 transitions. Second operand 7 states. [2018-12-09 03:08:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:08,196 INFO L93 Difference]: Finished difference Result 7531 states and 17026 transitions. [2018-12-09 03:08:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 03:08:08,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-09 03:08:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:08,201 INFO L225 Difference]: With dead ends: 7531 [2018-12-09 03:08:08,201 INFO L226 Difference]: Without dead ends: 7412 [2018-12-09 03:08:08,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 03:08:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2018-12-09 03:08:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 6250. [2018-12-09 03:08:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6250 states. [2018-12-09 03:08:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 14148 transitions. [2018-12-09 03:08:08,246 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 14148 transitions. Word has length 75 [2018-12-09 03:08:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:08,247 INFO L480 AbstractCegarLoop]: Abstraction has 6250 states and 14148 transitions. [2018-12-09 03:08:08,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 14148 transitions. [2018-12-09 03:08:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 03:08:08,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:08,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:08,251 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:08,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1111002780, now seen corresponding path program 1 times [2018-12-09 03:08:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:08,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:08,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:08,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:08,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:08,281 INFO L87 Difference]: Start difference. First operand 6250 states and 14148 transitions. Second operand 4 states. [2018-12-09 03:08:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:08,422 INFO L93 Difference]: Finished difference Result 9985 states and 22523 transitions. [2018-12-09 03:08:08,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:08,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 03:08:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:08,429 INFO L225 Difference]: With dead ends: 9985 [2018-12-09 03:08:08,429 INFO L226 Difference]: Without dead ends: 9985 [2018-12-09 03:08:08,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2018-12-09 03:08:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 7370. [2018-12-09 03:08:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7370 states. [2018-12-09 03:08:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 16482 transitions. [2018-12-09 03:08:08,488 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 16482 transitions. Word has length 94 [2018-12-09 03:08:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:08,488 INFO L480 AbstractCegarLoop]: Abstraction has 7370 states and 16482 transitions. [2018-12-09 03:08:08,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 16482 transitions. [2018-12-09 03:08:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 03:08:08,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:08,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:08,494 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:08,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1514778588, now seen corresponding path program 2 times [2018-12-09 03:08:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:08,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:08,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:08,523 INFO L87 Difference]: Start difference. First operand 7370 states and 16482 transitions. Second operand 4 states. [2018-12-09 03:08:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:08,636 INFO L93 Difference]: Finished difference Result 10358 states and 22888 transitions. [2018-12-09 03:08:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:08,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 03:08:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:08,642 INFO L225 Difference]: With dead ends: 10358 [2018-12-09 03:08:08,643 INFO L226 Difference]: Without dead ends: 10358 [2018-12-09 03:08:08,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2018-12-09 03:08:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 8483. [2018-12-09 03:08:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2018-12-09 03:08:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 18999 transitions. [2018-12-09 03:08:08,709 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 18999 transitions. Word has length 94 [2018-12-09 03:08:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:08,709 INFO L480 AbstractCegarLoop]: Abstraction has 8483 states and 18999 transitions. [2018-12-09 03:08:08,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 18999 transitions. [2018-12-09 03:08:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 03:08:08,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:08,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:08,714 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:08,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1112681667, now seen corresponding path program 1 times [2018-12-09 03:08:08,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:08,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:08:08,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:08,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:08,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:08:08,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:08,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:08:08,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:08:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:08:08,753 INFO L87 Difference]: Start difference. First operand 8483 states and 18999 transitions. Second operand 4 states. [2018-12-09 03:08:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:08,821 INFO L93 Difference]: Finished difference Result 8172 states and 18361 transitions. [2018-12-09 03:08:08,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:08:08,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 03:08:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:08,827 INFO L225 Difference]: With dead ends: 8172 [2018-12-09 03:08:08,827 INFO L226 Difference]: Without dead ends: 8172 [2018-12-09 03:08:08,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2018-12-09 03:08:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 7576. [2018-12-09 03:08:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7576 states. [2018-12-09 03:08:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7576 states to 7576 states and 17098 transitions. [2018-12-09 03:08:08,882 INFO L78 Accepts]: Start accepts. Automaton has 7576 states and 17098 transitions. Word has length 94 [2018-12-09 03:08:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:08,882 INFO L480 AbstractCegarLoop]: Abstraction has 7576 states and 17098 transitions. [2018-12-09 03:08:08,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:08:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7576 states and 17098 transitions. [2018-12-09 03:08:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:08,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:08,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:08,888 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:08,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2036619031, now seen corresponding path program 1 times [2018-12-09 03:08:08,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:08,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:08,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:08,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:08,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:08,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:08,943 INFO L87 Difference]: Start difference. First operand 7576 states and 17098 transitions. Second operand 7 states. [2018-12-09 03:08:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:09,268 INFO L93 Difference]: Finished difference Result 9459 states and 21323 transitions. [2018-12-09 03:08:09,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:09,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 03:08:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:09,274 INFO L225 Difference]: With dead ends: 9459 [2018-12-09 03:08:09,274 INFO L226 Difference]: Without dead ends: 9459 [2018-12-09 03:08:09,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9459 states. [2018-12-09 03:08:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9459 to 7665. [2018-12-09 03:08:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7665 states. [2018-12-09 03:08:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 17369 transitions. [2018-12-09 03:08:09,332 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 17369 transitions. Word has length 96 [2018-12-09 03:08:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:09,333 INFO L480 AbstractCegarLoop]: Abstraction has 7665 states and 17369 transitions. [2018-12-09 03:08:09,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 17369 transitions. [2018-12-09 03:08:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:09,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:09,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:09,337 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:09,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:09,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1052171828, now seen corresponding path program 1 times [2018-12-09 03:08:09,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:09,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:09,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:09,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:09,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:09,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:09,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:09,371 INFO L87 Difference]: Start difference. First operand 7665 states and 17369 transitions. Second operand 5 states. [2018-12-09 03:08:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:09,447 INFO L93 Difference]: Finished difference Result 8528 states and 19228 transitions. [2018-12-09 03:08:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:09,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 03:08:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:09,453 INFO L225 Difference]: With dead ends: 8528 [2018-12-09 03:08:09,453 INFO L226 Difference]: Without dead ends: 8528 [2018-12-09 03:08:09,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8528 states. [2018-12-09 03:08:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8528 to 6561. [2018-12-09 03:08:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2018-12-09 03:08:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 14888 transitions. [2018-12-09 03:08:09,507 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 14888 transitions. Word has length 96 [2018-12-09 03:08:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:09,508 INFO L480 AbstractCegarLoop]: Abstraction has 6561 states and 14888 transitions. [2018-12-09 03:08:09,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 14888 transitions. [2018-12-09 03:08:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:09,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:09,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:09,512 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1306908373, now seen corresponding path program 1 times [2018-12-09 03:08:09,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:09,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:09,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:09,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:08:09,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:09,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:08:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:08:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:08:09,541 INFO L87 Difference]: Start difference. First operand 6561 states and 14888 transitions. Second operand 5 states. [2018-12-09 03:08:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:09,782 INFO L93 Difference]: Finished difference Result 10030 states and 22788 transitions. [2018-12-09 03:08:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 03:08:09,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 03:08:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:09,789 INFO L225 Difference]: With dead ends: 10030 [2018-12-09 03:08:09,789 INFO L226 Difference]: Without dead ends: 9952 [2018-12-09 03:08:09,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 03:08:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9952 states. [2018-12-09 03:08:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9952 to 7455. [2018-12-09 03:08:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7455 states. [2018-12-09 03:08:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 16912 transitions. [2018-12-09 03:08:09,853 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 16912 transitions. Word has length 96 [2018-12-09 03:08:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:09,853 INFO L480 AbstractCegarLoop]: Abstraction has 7455 states and 16912 transitions. [2018-12-09 03:08:09,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:08:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 16912 transitions. [2018-12-09 03:08:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:09,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:09,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:09,860 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:09,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash -62143892, now seen corresponding path program 1 times [2018-12-09 03:08:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:09,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:09,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:09,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:09,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:09,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:09,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:09,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:09,925 INFO L87 Difference]: Start difference. First operand 7455 states and 16912 transitions. Second operand 6 states. [2018-12-09 03:08:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:10,105 INFO L93 Difference]: Finished difference Result 9421 states and 21193 transitions. [2018-12-09 03:08:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 03:08:10,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 03:08:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:10,111 INFO L225 Difference]: With dead ends: 9421 [2018-12-09 03:08:10,111 INFO L226 Difference]: Without dead ends: 9333 [2018-12-09 03:08:10,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:08:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9333 states. [2018-12-09 03:08:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9333 to 7000. [2018-12-09 03:08:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2018-12-09 03:08:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 15908 transitions. [2018-12-09 03:08:10,174 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 15908 transitions. Word has length 96 [2018-12-09 03:08:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:10,174 INFO L480 AbstractCegarLoop]: Abstraction has 7000 states and 15908 transitions. [2018-12-09 03:08:10,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 15908 transitions. [2018-12-09 03:08:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:10,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:10,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:10,180 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:10,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1067196945, now seen corresponding path program 1 times [2018-12-09 03:08:10,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:10,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:10,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:10,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:10,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 03:08:10,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:10,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 03:08:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 03:08:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:10,240 INFO L87 Difference]: Start difference. First operand 7000 states and 15908 transitions. Second operand 8 states. [2018-12-09 03:08:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:10,541 INFO L93 Difference]: Finished difference Result 10183 states and 23377 transitions. [2018-12-09 03:08:10,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 03:08:10,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 03:08:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:10,547 INFO L225 Difference]: With dead ends: 10183 [2018-12-09 03:08:10,548 INFO L226 Difference]: Without dead ends: 10183 [2018-12-09 03:08:10,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-09 03:08:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10183 states. [2018-12-09 03:08:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10183 to 7405. [2018-12-09 03:08:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7405 states. [2018-12-09 03:08:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 16958 transitions. [2018-12-09 03:08:10,618 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 16958 transitions. Word has length 96 [2018-12-09 03:08:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:10,618 INFO L480 AbstractCegarLoop]: Abstraction has 7405 states and 16958 transitions. [2018-12-09 03:08:10,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 03:08:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 16958 transitions. [2018-12-09 03:08:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:10,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:10,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:10,623 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:10,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1954700626, now seen corresponding path program 1 times [2018-12-09 03:08:10,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:10,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:10,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:10,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:10,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 03:08:10,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:08:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:08:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:10,693 INFO L87 Difference]: Start difference. First operand 7405 states and 16958 transitions. Second operand 7 states. [2018-12-09 03:08:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:10,801 INFO L93 Difference]: Finished difference Result 9532 states and 21919 transitions. [2018-12-09 03:08:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:10,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 03:08:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:10,808 INFO L225 Difference]: With dead ends: 9532 [2018-12-09 03:08:10,808 INFO L226 Difference]: Without dead ends: 9532 [2018-12-09 03:08:10,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:08:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9532 states. [2018-12-09 03:08:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9532 to 7249. [2018-12-09 03:08:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7249 states. [2018-12-09 03:08:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 16461 transitions. [2018-12-09 03:08:10,869 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 16461 transitions. Word has length 96 [2018-12-09 03:08:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:10,869 INFO L480 AbstractCegarLoop]: Abstraction has 7249 states and 16461 transitions. [2018-12-09 03:08:10,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:08:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 16461 transitions. [2018-12-09 03:08:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 03:08:10,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:10,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:10,874 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:10,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 222725074, now seen corresponding path program 1 times [2018-12-09 03:08:10,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:10,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:10,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:10,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:10,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:10,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:10,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:10,925 INFO L87 Difference]: Start difference. First operand 7249 states and 16461 transitions. Second operand 6 states. [2018-12-09 03:08:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:11,002 INFO L93 Difference]: Finished difference Result 6993 states and 15661 transitions. [2018-12-09 03:08:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:11,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 03:08:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:11,006 INFO L225 Difference]: With dead ends: 6993 [2018-12-09 03:08:11,007 INFO L226 Difference]: Without dead ends: 6993 [2018-12-09 03:08:11,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2018-12-09 03:08:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 5820. [2018-12-09 03:08:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5820 states. [2018-12-09 03:08:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5820 states to 5820 states and 13027 transitions. [2018-12-09 03:08:11,056 INFO L78 Accepts]: Start accepts. Automaton has 5820 states and 13027 transitions. Word has length 96 [2018-12-09 03:08:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:11,056 INFO L480 AbstractCegarLoop]: Abstraction has 5820 states and 13027 transitions. [2018-12-09 03:08:11,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5820 states and 13027 transitions. [2018-12-09 03:08:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 03:08:11,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:11,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:11,060 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:11,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -261116910, now seen corresponding path program 1 times [2018-12-09 03:08:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:11,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:11,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:11,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:11,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 03:08:11,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:11,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 03:08:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 03:08:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 03:08:11,155 INFO L87 Difference]: Start difference. First operand 5820 states and 13027 transitions. Second operand 13 states. [2018-12-09 03:08:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:11,749 INFO L93 Difference]: Finished difference Result 7882 states and 17366 transitions. [2018-12-09 03:08:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 03:08:11,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-12-09 03:08:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:11,754 INFO L225 Difference]: With dead ends: 7882 [2018-12-09 03:08:11,754 INFO L226 Difference]: Without dead ends: 7882 [2018-12-09 03:08:11,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 03:08:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2018-12-09 03:08:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 6531. [2018-12-09 03:08:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6531 states. [2018-12-09 03:08:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 14566 transitions. [2018-12-09 03:08:11,806 INFO L78 Accepts]: Start accepts. Automaton has 6531 states and 14566 transitions. Word has length 98 [2018-12-09 03:08:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:11,806 INFO L480 AbstractCegarLoop]: Abstraction has 6531 states and 14566 transitions. [2018-12-09 03:08:11,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 03:08:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6531 states and 14566 transitions. [2018-12-09 03:08:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 03:08:11,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:11,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:11,811 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:11,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash 626386771, now seen corresponding path program 1 times [2018-12-09 03:08:11,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:11,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:11,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:11,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 03:08:11,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:11,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 03:08:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 03:08:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 03:08:11,935 INFO L87 Difference]: Start difference. First operand 6531 states and 14566 transitions. Second operand 11 states. [2018-12-09 03:08:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:12,965 INFO L93 Difference]: Finished difference Result 12540 states and 28140 transitions. [2018-12-09 03:08:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 03:08:12,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-09 03:08:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:12,971 INFO L225 Difference]: With dead ends: 12540 [2018-12-09 03:08:12,971 INFO L226 Difference]: Without dead ends: 8776 [2018-12-09 03:08:12,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-12-09 03:08:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2018-12-09 03:08:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 6472. [2018-12-09 03:08:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2018-12-09 03:08:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 14372 transitions. [2018-12-09 03:08:13,024 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 14372 transitions. Word has length 98 [2018-12-09 03:08:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:13,024 INFO L480 AbstractCegarLoop]: Abstraction has 6472 states and 14372 transitions. [2018-12-09 03:08:13,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 03:08:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 14372 transitions. [2018-12-09 03:08:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 03:08:13,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:13,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:13,028 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:13,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash -23820502, now seen corresponding path program 1 times [2018-12-09 03:08:13,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:13,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:13,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:13,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:13,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:13,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:13,093 INFO L87 Difference]: Start difference. First operand 6472 states and 14372 transitions. Second operand 6 states. [2018-12-09 03:08:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:13,179 INFO L93 Difference]: Finished difference Result 7253 states and 15910 transitions. [2018-12-09 03:08:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 03:08:13,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-09 03:08:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:13,184 INFO L225 Difference]: With dead ends: 7253 [2018-12-09 03:08:13,184 INFO L226 Difference]: Without dead ends: 7207 [2018-12-09 03:08:13,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 03:08:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2018-12-09 03:08:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 6482. [2018-12-09 03:08:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2018-12-09 03:08:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 14252 transitions. [2018-12-09 03:08:13,232 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 14252 transitions. Word has length 98 [2018-12-09 03:08:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:13,232 INFO L480 AbstractCegarLoop]: Abstraction has 6482 states and 14252 transitions. [2018-12-09 03:08:13,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 14252 transitions. [2018-12-09 03:08:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 03:08:13,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:13,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:13,237 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:13,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 956895515, now seen corresponding path program 1 times [2018-12-09 03:08:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:13,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:08:13,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:13,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:08:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:08:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:08:13,281 INFO L87 Difference]: Start difference. First operand 6482 states and 14252 transitions. Second operand 6 states. [2018-12-09 03:08:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:13,384 INFO L93 Difference]: Finished difference Result 6880 states and 15042 transitions. [2018-12-09 03:08:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:08:13,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-09 03:08:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:13,389 INFO L225 Difference]: With dead ends: 6880 [2018-12-09 03:08:13,389 INFO L226 Difference]: Without dead ends: 6880 [2018-12-09 03:08:13,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 03:08:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6880 states. [2018-12-09 03:08:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6880 to 6379. [2018-12-09 03:08:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2018-12-09 03:08:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 14016 transitions. [2018-12-09 03:08:13,435 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 14016 transitions. Word has length 98 [2018-12-09 03:08:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:13,436 INFO L480 AbstractCegarLoop]: Abstraction has 6379 states and 14016 transitions. [2018-12-09 03:08:13,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:08:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 14016 transitions. [2018-12-09 03:08:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 03:08:13,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:13,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:13,440 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:13,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:13,441 INFO L82 PathProgramCache]: Analyzing trace with hash -946504085, now seen corresponding path program 1 times [2018-12-09 03:08:13,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:13,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:13,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:13,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:13,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:13,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:08:13,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 03:08:13,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:08:13,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 03:08:13,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 03:08:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:08:13,533 INFO L87 Difference]: Start difference. First operand 6379 states and 14016 transitions. Second operand 12 states. [2018-12-09 03:08:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:14,026 INFO L93 Difference]: Finished difference Result 8573 states and 18737 transitions. [2018-12-09 03:08:14,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 03:08:14,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2018-12-09 03:08:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:14,031 INFO L225 Difference]: With dead ends: 8573 [2018-12-09 03:08:14,031 INFO L226 Difference]: Without dead ends: 8573 [2018-12-09 03:08:14,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-12-09 03:08:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2018-12-09 03:08:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 6402. [2018-12-09 03:08:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6402 states. [2018-12-09 03:08:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 14065 transitions. [2018-12-09 03:08:14,088 INFO L78 Accepts]: Start accepts. Automaton has 6402 states and 14065 transitions. Word has length 98 [2018-12-09 03:08:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:14,089 INFO L480 AbstractCegarLoop]: Abstraction has 6402 states and 14065 transitions. [2018-12-09 03:08:14,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 03:08:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6402 states and 14065 transitions. [2018-12-09 03:08:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 03:08:14,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:14,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:14,092 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:14,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash -879565369, now seen corresponding path program 2 times [2018-12-09 03:08:14,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:14,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:14,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:14,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:14,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:14,128 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 03:08:14,199 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 03:08:14,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:08:14 BasicIcfg [2018-12-09 03:08:14,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 03:08:14,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:08:14,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:08:14,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:08:14,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:57" (3/4) ... [2018-12-09 03:08:14,203 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 03:08:14,278 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1f628e0-28df-4a1e-9601-399107449b50/bin-2019/utaipan/witness.graphml [2018-12-09 03:08:14,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:08:14,279 INFO L168 Benchmark]: Toolchain (without parser) took 17764.65 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 951.7 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 250.4 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:14,280 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:14,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -117.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:14,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.54 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:14,280 INFO L168 Benchmark]: Boogie Preprocessor took 20.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:14,280 INFO L168 Benchmark]: RCFGBuilder took 363.91 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:14,280 INFO L168 Benchmark]: TraceAbstraction took 16946.14 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:14,281 INFO L168 Benchmark]: Witness Printer took 78.02 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:14,281 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -117.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.54 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.09 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 363.91 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16946.14 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. * Witness Printer took 78.02 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t251; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t251, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t252; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t252, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 16.8s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8974 SDtfs, 9735 SDslu, 20355 SDs, 0 SdLazy, 9200 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 92 SyntacticMatches, 26 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34809occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 91080 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2741 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2609 ConstructedInterpolants, 0 QuantifiedInterpolants, 577379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...