./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_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/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_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/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-03 03:43:59,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:43:59,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:43:59,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:43:59,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:43:59,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:43:59,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:43:59,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:43:59,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:43:59,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:43:59,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:43:59,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:43:59,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:43:59,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:43:59,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:43:59,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:43:59,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:43:59,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:43:59,898 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:43:59,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:43:59,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:43:59,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:43:59,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:43:59,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:43:59,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:43:59,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:43:59,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:43:59,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:43:59,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:43:59,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:43:59,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:43:59,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:43:59,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:43:59,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:43:59,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:43:59,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:43:59,904 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 03:43:59,911 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:43:59,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:43:59,912 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:43:59,912 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:43:59,912 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:43:59,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:43:59,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:43:59,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:43:59,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:43:59,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:43:59,915 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:43:59,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:43:59,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:43:59,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:43:59,915 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_72d20192-2cec-42ce-a1e3-eb4bec7749d4/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-03 03:43:59,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:43:59,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:43:59,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:43:59,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:43:59,941 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:43:59,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-12-03 03:43:59,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/data/1a26daaae/fdfcb68afdb24b44adf028af765ac3fb/FLAG7472b510c [2018-12-03 03:44:00,414 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:44:00,415 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-12-03 03:44:00,422 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/data/1a26daaae/fdfcb68afdb24b44adf028af765ac3fb/FLAG7472b510c [2018-12-03 03:44:00,431 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/data/1a26daaae/fdfcb68afdb24b44adf028af765ac3fb [2018-12-03 03:44:00,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:44:00,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:44:00,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:44:00,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:44:00,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:44:00,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55da98ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00, skipping insertion in model container [2018-12-03 03:44:00,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:44:00,462 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:44:00,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:44:00,647 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:44:00,718 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:44:00,748 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:44:00,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00 WrapperNode [2018-12-03 03:44:00,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:44:00,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:44:00,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:44:00,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:44:00,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:44:00,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:44:00,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:44:00,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:44:00,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... [2018-12-03 03:44:00,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:44:00,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:44:00,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:44:00,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:44:00,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 03:44:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 03:44:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 03:44:00,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:44:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:44:00,836 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 03:44:01,134 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:44:01,134 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 03:44:01,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:44:01 BoogieIcfgContainer [2018-12-03 03:44:01,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:44:01,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:44:01,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:44:01,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:44:01,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:44:00" (1/3) ... [2018-12-03 03:44:01,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cad9aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:44:01, skipping insertion in model container [2018-12-03 03:44:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:44:00" (2/3) ... [2018-12-03 03:44:01,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cad9aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:44:01, skipping insertion in model container [2018-12-03 03:44:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:44:01" (3/3) ... [2018-12-03 03:44:01,139 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc_false-unreach-call.i [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,166 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 03:44:01,180 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 03:44:01,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:44:01,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 03:44:01,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 03:44:01,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:44:01,211 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:44:01,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:44:01,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:44:01,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:44:01,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:44:01,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:44:01,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:44:01,218 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-03 03:44:02,940 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-03 03:44:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-03 03:44:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 03:44:02,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:02,947 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-03 03:44:02,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:02,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-03 03:44:02,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:02,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:03,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:03,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:03,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:03,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:03,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:03,118 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-03 03:44:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:03,643 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-03 03:44:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:44:03,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-03 03:44:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:03,814 INFO L225 Difference]: With dead ends: 60793 [2018-12-03 03:44:03,814 INFO L226 Difference]: Without dead ends: 44273 [2018-12-03 03:44:03,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-03 03:44:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-03 03:44:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-03 03:44:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-03 03:44:04,606 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-03 03:44:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:04,606 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-03 03:44:04,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-03 03:44:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 03:44:04,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:04,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:04,611 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:04,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-03 03:44:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:04,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:04,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:04,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:04,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:04,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:04,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:04,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:04,663 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-12-03 03:44:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:04,751 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-12-03 03:44:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:44:04,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-03 03:44:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:04,764 INFO L225 Difference]: With dead ends: 8531 [2018-12-03 03:44:04,764 INFO L226 Difference]: Without dead ends: 7469 [2018-12-03 03:44:04,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-03 03:44:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-12-03 03:44:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-12-03 03:44:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-12-03 03:44:04,850 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-12-03 03:44:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:04,850 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-12-03 03:44:04,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-12-03 03:44:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 03:44:04,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:04,851 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-03 03:44:04,851 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:04,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-03 03:44:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:04,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:04,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:04,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:04,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:44:04,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:04,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:44:04,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:44:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:04,906 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-12-03 03:44:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:05,099 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-12-03 03:44:05,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:05,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-03 03:44:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:05,125 INFO L225 Difference]: With dead ends: 14001 [2018-12-03 03:44:05,126 INFO L226 Difference]: Without dead ends: 13933 [2018-12-03 03:44:05,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:44:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-12-03 03:44:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-12-03 03:44:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-12-03 03:44:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-12-03 03:44:05,340 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-12-03 03:44:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:05,341 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-12-03 03:44:05,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:44:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-12-03 03:44:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 03:44:05,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:05,342 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-03 03:44:05,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:05,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-03 03:44:05,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:05,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:05,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:05,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:44:05,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:05,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:44:05,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:44:05,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:05,379 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-12-03 03:44:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:05,456 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-12-03 03:44:05,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:44:05,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 03:44:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:05,476 INFO L225 Difference]: With dead ends: 13282 [2018-12-03 03:44:05,476 INFO L226 Difference]: Without dead ends: 13282 [2018-12-03 03:44:05,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-12-03 03:44:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-12-03 03:44:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-12-03 03:44:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-12-03 03:44:05,602 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-12-03 03:44:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-12-03 03:44:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:44:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-12-03 03:44:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 03:44:05,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:05,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:05,604 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:05,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-03 03:44:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:05,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:05,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:05,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:05,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:05,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:05,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:05,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:05,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:05,672 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-12-03 03:44:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:05,924 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-12-03 03:44:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 03:44:05,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-03 03:44:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:05,942 INFO L225 Difference]: With dead ends: 14206 [2018-12-03 03:44:05,942 INFO L226 Difference]: Without dead ends: 14134 [2018-12-03 03:44:05,943 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-03 03:44:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-12-03 03:44:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-12-03 03:44:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-12-03 03:44:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-12-03 03:44:06,073 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-12-03 03:44:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:06,074 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-12-03 03:44:06,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-12-03 03:44:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 03:44:06,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:06,077 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-03 03:44:06,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:06,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-03 03:44:06,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:06,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:06,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:06,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:06,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:06,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:06,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:06,121 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-12-03 03:44:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:06,198 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-12-03 03:44:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:44:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-03 03:44:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:06,212 INFO L225 Difference]: With dead ends: 12399 [2018-12-03 03:44:06,212 INFO L226 Difference]: Without dead ends: 12399 [2018-12-03 03:44:06,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-12-03 03:44:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-12-03 03:44:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-12-03 03:44:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-12-03 03:44:06,338 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-12-03 03:44:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:06,338 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-12-03 03:44:06,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-12-03 03:44:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 03:44:06,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:06,342 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-03 03:44:06,342 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:06,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-03 03:44:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:06,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:06,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:06,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:06,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:06,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:06,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:06,406 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-12-03 03:44:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:06,737 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-12-03 03:44:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 03:44:06,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-03 03:44:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:06,829 INFO L225 Difference]: With dead ends: 20972 [2018-12-03 03:44:06,829 INFO L226 Difference]: Without dead ends: 20901 [2018-12-03 03:44:06,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 03:44:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-12-03 03:44:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-12-03 03:44:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-12-03 03:44:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-12-03 03:44:06,991 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-12-03 03:44:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:06,991 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-12-03 03:44:06,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-12-03 03:44:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 03:44:06,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:06,997 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-03 03:44:06,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:06,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 81708496, now seen corresponding path program 1 times [2018-12-03 03:44:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:06,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:06,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:06,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:06,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:07,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:07,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:07,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:07,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:07,039 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-12-03 03:44:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:07,256 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-12-03 03:44:07,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:44:07,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 03:44:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:07,279 INFO L225 Difference]: With dead ends: 19950 [2018-12-03 03:44:07,279 INFO L226 Difference]: Without dead ends: 19950 [2018-12-03 03:44:07,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-12-03 03:44:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-12-03 03:44:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-12-03 03:44:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-12-03 03:44:07,486 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-12-03 03:44:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:07,486 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-12-03 03:44:07,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-12-03 03:44:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 03:44:07,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:07,490 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-03 03:44:07,491 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:07,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-12-03 03:44:07,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:07,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:07,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:07,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:07,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:07,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:07,540 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-12-03 03:44:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:07,714 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-12-03 03:44:07,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:44:07,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 03:44:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:07,739 INFO L225 Difference]: With dead ends: 22122 [2018-12-03 03:44:07,739 INFO L226 Difference]: Without dead ends: 22122 [2018-12-03 03:44:07,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-12-03 03:44:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-12-03 03:44:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-12-03 03:44:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-12-03 03:44:08,016 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-12-03 03:44:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:08,016 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-12-03 03:44:08,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-12-03 03:44:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 03:44:08,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:08,022 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-03 03:44:08,022 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:08,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-12-03 03:44:08,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:08,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:08,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:08,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:08,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:44:08,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:08,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:44:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:44:08,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:08,040 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-12-03 03:44:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:08,189 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-12-03 03:44:08,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:44:08,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 03:44:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:08,215 INFO L225 Difference]: With dead ends: 20728 [2018-12-03 03:44:08,215 INFO L226 Difference]: Without dead ends: 20728 [2018-12-03 03:44:08,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-12-03 03:44:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-12-03 03:44:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-12-03 03:44:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-12-03 03:44:08,436 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-12-03 03:44:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:08,436 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-12-03 03:44:08,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:44:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-12-03 03:44:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:08,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:08,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:08,443 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:08,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-12-03 03:44:08,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:08,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:08,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:08,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:08,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:08,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:08,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:44:08,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:08,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:44:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:44:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:08,476 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-12-03 03:44:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:08,619 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-12-03 03:44:08,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:44:08,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 03:44:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:08,650 INFO L225 Difference]: With dead ends: 25692 [2018-12-03 03:44:08,650 INFO L226 Difference]: Without dead ends: 25692 [2018-12-03 03:44:08,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-12-03 03:44:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-12-03 03:44:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-12-03 03:44:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-12-03 03:44:08,921 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-12-03 03:44:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:08,921 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-12-03 03:44:08,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:44:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-12-03 03:44:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:08,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:08,929 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-03 03:44:08,929 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:08,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-12-03 03:44:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:08,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:08,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:08,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:08,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:08,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:08,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:08,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:08,986 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-12-03 03:44:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:09,595 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-12-03 03:44:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:09,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 03:44:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:09,628 INFO L225 Difference]: With dead ends: 29944 [2018-12-03 03:44:09,629 INFO L226 Difference]: Without dead ends: 29944 [2018-12-03 03:44:09,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-12-03 03:44:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-12-03 03:44:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-12-03 03:44:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-12-03 03:44:10,029 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-12-03 03:44:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:10,030 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-12-03 03:44:10,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-12-03 03:44:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:10,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:10,039 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-03 03:44:10,039 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:10,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-12-03 03:44:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:10,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:10,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:10,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:10,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:10,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:10,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:10,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:10,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:10,101 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-12-03 03:44:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:10,401 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-12-03 03:44:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 03:44:10,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-03 03:44:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:10,437 INFO L225 Difference]: With dead ends: 32012 [2018-12-03 03:44:10,437 INFO L226 Difference]: Without dead ends: 32012 [2018-12-03 03:44:10,438 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-03 03:44:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-12-03 03:44:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-12-03 03:44:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-12-03 03:44:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-12-03 03:44:10,762 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-12-03 03:44:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:10,763 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-12-03 03:44:10,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-12-03 03:44:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:10,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:10,772 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-03 03:44:10,773 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:10,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:10,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-12-03 03:44:10,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:10,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:10,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:10,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:10,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:44:10,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:10,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:44:10,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:44:10,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:10,811 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-12-03 03:44:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:11,054 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-12-03 03:44:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:11,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-03 03:44:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:11,096 INFO L225 Difference]: With dead ends: 35071 [2018-12-03 03:44:11,096 INFO L226 Difference]: Without dead ends: 35071 [2018-12-03 03:44:11,097 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-03 03:44:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-12-03 03:44:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-12-03 03:44:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-12-03 03:44:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-12-03 03:44:11,457 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-12-03 03:44:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:11,457 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-12-03 03:44:11,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:44:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-12-03 03:44:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:11,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:11,467 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-03 03:44:11,467 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:11,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-12-03 03:44:11,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:11,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:11,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:11,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:11,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:11,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:11,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:44:11,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:11,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:44:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:44:11,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:11,487 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-12-03 03:44:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:11,747 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-12-03 03:44:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:44:11,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 03:44:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:11,792 INFO L225 Difference]: With dead ends: 42528 [2018-12-03 03:44:11,792 INFO L226 Difference]: Without dead ends: 42528 [2018-12-03 03:44:11,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-12-03 03:44:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-12-03 03:44:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-12-03 03:44:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-12-03 03:44:12,185 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-12-03 03:44:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:12,185 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-12-03 03:44:12,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:44:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-12-03 03:44:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:12,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:12,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:12,196 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:12,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-12-03 03:44:12,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:44:12,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:12,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:44:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:44:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:12,233 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 5 states. [2018-12-03 03:44:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:12,268 INFO L93 Difference]: Finished difference Result 7904 states and 19093 transitions. [2018-12-03 03:44:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:44:12,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-03 03:44:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:12,273 INFO L225 Difference]: With dead ends: 7904 [2018-12-03 03:44:12,273 INFO L226 Difference]: Without dead ends: 6422 [2018-12-03 03:44:12,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2018-12-03 03:44:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 5770. [2018-12-03 03:44:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5770 states. [2018-12-03 03:44:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 13511 transitions. [2018-12-03 03:44:12,320 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 13511 transitions. Word has length 69 [2018-12-03 03:44:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:12,320 INFO L480 AbstractCegarLoop]: Abstraction has 5770 states and 13511 transitions. [2018-12-03 03:44:12,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:44:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 13511 transitions. [2018-12-03 03:44:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 03:44:12,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:12,324 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-03 03:44:12,324 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:12,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-03 03:44:12,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:12,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:12,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:44:12,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:12,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:44:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:44:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:12,345 INFO L87 Difference]: Start difference. First operand 5770 states and 13511 transitions. Second operand 3 states. [2018-12-03 03:44:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:12,377 INFO L93 Difference]: Finished difference Result 7636 states and 17741 transitions. [2018-12-03 03:44:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:44:12,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 03:44:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:12,383 INFO L225 Difference]: With dead ends: 7636 [2018-12-03 03:44:12,383 INFO L226 Difference]: Without dead ends: 7636 [2018-12-03 03:44:12,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:44:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2018-12-03 03:44:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 5709. [2018-12-03 03:44:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-12-03 03:44:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 13051 transitions. [2018-12-03 03:44:12,435 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 13051 transitions. Word has length 69 [2018-12-03 03:44:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:12,435 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 13051 transitions. [2018-12-03 03:44:12,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:44:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 13051 transitions. [2018-12-03 03:44:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 03:44:12,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:12,439 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-03 03:44:12,439 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:12,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-03 03:44:12,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:12,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:44:12,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:12,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:44:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:44:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:12,468 INFO L87 Difference]: Start difference. First operand 5709 states and 13051 transitions. Second operand 5 states. [2018-12-03 03:44:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:12,566 INFO L93 Difference]: Finished difference Result 6873 states and 15675 transitions. [2018-12-03 03:44:12,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 03:44:12,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-03 03:44:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:12,570 INFO L225 Difference]: With dead ends: 6873 [2018-12-03 03:44:12,570 INFO L226 Difference]: Without dead ends: 6873 [2018-12-03 03:44:12,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:44:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2018-12-03 03:44:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 6153. [2018-12-03 03:44:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-12-03 03:44:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 14055 transitions. [2018-12-03 03:44:12,614 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 14055 transitions. Word has length 75 [2018-12-03 03:44:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:12,614 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 14055 transitions. [2018-12-03 03:44:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:44:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 14055 transitions. [2018-12-03 03:44:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 03:44:12,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:12,618 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-03 03:44:12,618 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:12,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-03 03:44:12,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:12,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:12,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 03:44:12,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:12,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:44:12,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:44:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:12,666 INFO L87 Difference]: Start difference. First operand 6153 states and 14055 transitions. Second operand 7 states. [2018-12-03 03:44:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:12,886 INFO L93 Difference]: Finished difference Result 7531 states and 17026 transitions. [2018-12-03 03:44:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 03:44:12,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-03 03:44:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:12,891 INFO L225 Difference]: With dead ends: 7531 [2018-12-03 03:44:12,891 INFO L226 Difference]: Without dead ends: 7412 [2018-12-03 03:44:12,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-03 03:44:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2018-12-03 03:44:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 6250. [2018-12-03 03:44:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6250 states. [2018-12-03 03:44:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 14148 transitions. [2018-12-03 03:44:12,941 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 14148 transitions. Word has length 75 [2018-12-03 03:44:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:12,941 INFO L480 AbstractCegarLoop]: Abstraction has 6250 states and 14148 transitions. [2018-12-03 03:44:12,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:44:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 14148 transitions. [2018-12-03 03:44:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 03:44:12,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:12,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:12,946 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:12,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1874738626, now seen corresponding path program 1 times [2018-12-03 03:44:12,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:12,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:12,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-03 03:44:12,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:12,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:12,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:12,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:12,985 INFO L87 Difference]: Start difference. First operand 6250 states and 14148 transitions. Second operand 4 states. [2018-12-03 03:44:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:13,144 INFO L93 Difference]: Finished difference Result 9985 states and 22523 transitions. [2018-12-03 03:44:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:44:13,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 03:44:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:13,150 INFO L225 Difference]: With dead ends: 9985 [2018-12-03 03:44:13,150 INFO L226 Difference]: Without dead ends: 9985 [2018-12-03 03:44:13,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2018-12-03 03:44:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 7370. [2018-12-03 03:44:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7370 states. [2018-12-03 03:44:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 16482 transitions. [2018-12-03 03:44:13,212 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 16482 transitions. Word has length 94 [2018-12-03 03:44:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:13,212 INFO L480 AbstractCegarLoop]: Abstraction has 7370 states and 16482 transitions. [2018-12-03 03:44:13,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 16482 transitions. [2018-12-03 03:44:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 03:44:13,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:13,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:13,218 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:13,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:13,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1947207202, now seen corresponding path program 2 times [2018-12-03 03:44:13,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:13,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:13,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:13,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:13,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:13,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:13,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:13,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:13,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:13,256 INFO L87 Difference]: Start difference. First operand 7370 states and 16482 transitions. Second operand 4 states. [2018-12-03 03:44:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:13,360 INFO L93 Difference]: Finished difference Result 10358 states and 22888 transitions. [2018-12-03 03:44:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:44:13,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 03:44:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:13,367 INFO L225 Difference]: With dead ends: 10358 [2018-12-03 03:44:13,367 INFO L226 Difference]: Without dead ends: 10358 [2018-12-03 03:44:13,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2018-12-03 03:44:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 8483. [2018-12-03 03:44:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2018-12-03 03:44:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 18999 transitions. [2018-12-03 03:44:13,431 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 18999 transitions. Word has length 94 [2018-12-03 03:44:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:13,432 INFO L480 AbstractCegarLoop]: Abstraction has 8483 states and 18999 transitions. [2018-12-03 03:44:13,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 18999 transitions. [2018-12-03 03:44:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 03:44:13,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:13,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:13,437 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:13,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1945663173, now seen corresponding path program 1 times [2018-12-03 03:44:13,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:13,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 03:44:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:13,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:44:13,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:13,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:44:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:44:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:44:13,475 INFO L87 Difference]: Start difference. First operand 8483 states and 18999 transitions. Second operand 4 states. [2018-12-03 03:44:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:13,552 INFO L93 Difference]: Finished difference Result 8172 states and 18361 transitions. [2018-12-03 03:44:13,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:44:13,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 03:44:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:13,557 INFO L225 Difference]: With dead ends: 8172 [2018-12-03 03:44:13,557 INFO L226 Difference]: Without dead ends: 8172 [2018-12-03 03:44:13,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2018-12-03 03:44:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 7576. [2018-12-03 03:44:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7576 states. [2018-12-03 03:44:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7576 states to 7576 states and 17098 transitions. [2018-12-03 03:44:13,612 INFO L78 Accepts]: Start accepts. Automaton has 7576 states and 17098 transitions. Word has length 94 [2018-12-03 03:44:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:13,612 INFO L480 AbstractCegarLoop]: Abstraction has 7576 states and 17098 transitions. [2018-12-03 03:44:13,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:44:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7576 states and 17098 transitions. [2018-12-03 03:44:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:13,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:13,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:13,619 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:13,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1777281593, now seen corresponding path program 1 times [2018-12-03 03:44:13,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:13,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:13,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:13,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 03:44:13,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:13,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:44:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:44:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:13,688 INFO L87 Difference]: Start difference. First operand 7576 states and 17098 transitions. Second operand 7 states. [2018-12-03 03:44:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:14,054 INFO L93 Difference]: Finished difference Result 9459 states and 21323 transitions. [2018-12-03 03:44:14,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:14,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 03:44:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:14,061 INFO L225 Difference]: With dead ends: 9459 [2018-12-03 03:44:14,061 INFO L226 Difference]: Without dead ends: 9459 [2018-12-03 03:44:14,061 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-03 03:44:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9459 states. [2018-12-03 03:44:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9459 to 7665. [2018-12-03 03:44:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7665 states. [2018-12-03 03:44:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 17369 transitions. [2018-12-03 03:44:14,124 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 17369 transitions. Word has length 96 [2018-12-03 03:44:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:14,124 INFO L480 AbstractCegarLoop]: Abstraction has 7665 states and 17369 transitions. [2018-12-03 03:44:14,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:44:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 17369 transitions. [2018-12-03 03:44:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:14,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:14,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:14,130 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:14,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1611485258, now seen corresponding path program 1 times [2018-12-03 03:44:14,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:14,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:14,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:44:14,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:14,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:44:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:44:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:14,176 INFO L87 Difference]: Start difference. First operand 7665 states and 17369 transitions. Second operand 5 states. [2018-12-03 03:44:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:14,234 INFO L93 Difference]: Finished difference Result 8528 states and 19228 transitions. [2018-12-03 03:44:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:14,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 03:44:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:14,239 INFO L225 Difference]: With dead ends: 8528 [2018-12-03 03:44:14,239 INFO L226 Difference]: Without dead ends: 8528 [2018-12-03 03:44:14,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8528 states. [2018-12-03 03:44:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8528 to 6561. [2018-12-03 03:44:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2018-12-03 03:44:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 14888 transitions. [2018-12-03 03:44:14,298 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 14888 transitions. Word has length 96 [2018-12-03 03:44:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:14,299 INFO L480 AbstractCegarLoop]: Abstraction has 6561 states and 14888 transitions. [2018-12-03 03:44:14,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:44:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 14888 transitions. [2018-12-03 03:44:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:14,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:14,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:14,305 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:14,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1356748713, now seen corresponding path program 1 times [2018-12-03 03:44:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:14,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:14,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:44:14,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:14,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:44:14,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:44:14,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:44:14,360 INFO L87 Difference]: Start difference. First operand 6561 states and 14888 transitions. Second operand 5 states. [2018-12-03 03:44:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:14,606 INFO L93 Difference]: Finished difference Result 10030 states and 22788 transitions. [2018-12-03 03:44:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 03:44:14,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 03:44:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:14,612 INFO L225 Difference]: With dead ends: 10030 [2018-12-03 03:44:14,612 INFO L226 Difference]: Without dead ends: 9952 [2018-12-03 03:44:14,613 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-03 03:44:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9952 states. [2018-12-03 03:44:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9952 to 7455. [2018-12-03 03:44:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7455 states. [2018-12-03 03:44:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 16912 transitions. [2018-12-03 03:44:14,674 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 16912 transitions. Word has length 96 [2018-12-03 03:44:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:14,674 INFO L480 AbstractCegarLoop]: Abstraction has 7455 states and 16912 transitions. [2018-12-03 03:44:14,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:44:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 16912 transitions. [2018-12-03 03:44:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:14,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:14,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:14,679 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:14,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1693454102, now seen corresponding path program 1 times [2018-12-03 03:44:14,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:14,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:14,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:14,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:14,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:14,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:14,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:14,739 INFO L87 Difference]: Start difference. First operand 7455 states and 16912 transitions. Second operand 6 states. [2018-12-03 03:44:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:14,918 INFO L93 Difference]: Finished difference Result 9421 states and 21193 transitions. [2018-12-03 03:44:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 03:44:14,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 03:44:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:14,924 INFO L225 Difference]: With dead ends: 9421 [2018-12-03 03:44:14,924 INFO L226 Difference]: Without dead ends: 9333 [2018-12-03 03:44:14,924 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-03 03:44:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9333 states. [2018-12-03 03:44:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9333 to 7000. [2018-12-03 03:44:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2018-12-03 03:44:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 15908 transitions. [2018-12-03 03:44:14,983 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 15908 transitions. Word has length 96 [2018-12-03 03:44:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:14,983 INFO L480 AbstractCegarLoop]: Abstraction has 7000 states and 15908 transitions. [2018-12-03 03:44:14,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 15908 transitions. [2018-12-03 03:44:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:14,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:14,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:14,988 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:14,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash -564113265, now seen corresponding path program 1 times [2018-12-03 03:44:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:14,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:15,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:15,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 03:44:15,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:15,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 03:44:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 03:44:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:44:15,044 INFO L87 Difference]: Start difference. First operand 7000 states and 15908 transitions. Second operand 8 states. [2018-12-03 03:44:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:15,254 INFO L93 Difference]: Finished difference Result 10183 states and 23377 transitions. [2018-12-03 03:44:15,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 03:44:15,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-03 03:44:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:15,261 INFO L225 Difference]: With dead ends: 10183 [2018-12-03 03:44:15,261 INFO L226 Difference]: Without dead ends: 10183 [2018-12-03 03:44:15,261 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-03 03:44:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10183 states. [2018-12-03 03:44:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10183 to 7405. [2018-12-03 03:44:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7405 states. [2018-12-03 03:44:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 16958 transitions. [2018-12-03 03:44:15,327 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 16958 transitions. Word has length 96 [2018-12-03 03:44:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:15,327 INFO L480 AbstractCegarLoop]: Abstraction has 7405 states and 16958 transitions. [2018-12-03 03:44:15,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 03:44:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 16958 transitions. [2018-12-03 03:44:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:15,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:15,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:15,332 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:15,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash 323390416, now seen corresponding path program 1 times [2018-12-03 03:44:15,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:15,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:15,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:15,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:15,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 03:44:15,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:15,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 03:44:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 03:44:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:44:15,417 INFO L87 Difference]: Start difference. First operand 7405 states and 16958 transitions. Second operand 10 states. [2018-12-03 03:44:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:15,855 INFO L93 Difference]: Finished difference Result 11432 states and 26103 transitions. [2018-12-03 03:44:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 03:44:15,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 03:44:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:15,863 INFO L225 Difference]: With dead ends: 11432 [2018-12-03 03:44:15,863 INFO L226 Difference]: Without dead ends: 11432 [2018-12-03 03:44:15,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-03 03:44:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11432 states. [2018-12-03 03:44:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11432 to 9031. [2018-12-03 03:44:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2018-12-03 03:44:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 20483 transitions. [2018-12-03 03:44:15,940 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 20483 transitions. Word has length 96 [2018-12-03 03:44:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:15,940 INFO L480 AbstractCegarLoop]: Abstraction has 9031 states and 20483 transitions. [2018-12-03 03:44:15,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 03:44:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 20483 transitions. [2018-12-03 03:44:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 03:44:15,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:15,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:15,946 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:15,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1408585136, now seen corresponding path program 1 times [2018-12-03 03:44:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:15,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:15,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:15,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:15,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:16,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:16,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:16,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:16,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:16,002 INFO L87 Difference]: Start difference. First operand 9031 states and 20483 transitions. Second operand 6 states. [2018-12-03 03:44:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:16,085 INFO L93 Difference]: Finished difference Result 8775 states and 19683 transitions. [2018-12-03 03:44:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:16,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 03:44:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:16,091 INFO L225 Difference]: With dead ends: 8775 [2018-12-03 03:44:16,091 INFO L226 Difference]: Without dead ends: 8775 [2018-12-03 03:44:16,091 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-03 03:44:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8775 states. [2018-12-03 03:44:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 7134. [2018-12-03 03:44:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-12-03 03:44:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16071 transitions. [2018-12-03 03:44:16,156 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16071 transitions. Word has length 96 [2018-12-03 03:44:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:16,156 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 16071 transitions. [2018-12-03 03:44:16,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16071 transitions. [2018-12-03 03:44:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:16,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:16,161 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-03 03:44:16,161 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:16,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2018-12-03 03:44:16,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:16,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:16,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:16,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:16,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 03:44:16,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:16,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 03:44:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 03:44:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:44:16,261 INFO L87 Difference]: Start difference. First operand 7134 states and 16071 transitions. Second operand 9 states. [2018-12-03 03:44:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:16,552 INFO L93 Difference]: Finished difference Result 8476 states and 18918 transitions. [2018-12-03 03:44:16,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 03:44:16,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-03 03:44:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:16,557 INFO L225 Difference]: With dead ends: 8476 [2018-12-03 03:44:16,558 INFO L226 Difference]: Without dead ends: 8476 [2018-12-03 03:44:16,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-03 03:44:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states. [2018-12-03 03:44:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 8212. [2018-12-03 03:44:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2018-12-03 03:44:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 18398 transitions. [2018-12-03 03:44:16,614 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 18398 transitions. Word has length 98 [2018-12-03 03:44:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:16,614 INFO L480 AbstractCegarLoop]: Abstraction has 8212 states and 18398 transitions. [2018-12-03 03:44:16,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 03:44:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 18398 transitions. [2018-12-03 03:44:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:16,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:16,619 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-03 03:44:16,619 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:16,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:16,619 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2018-12-03 03:44:16,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:16,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:16,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:16,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:16,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 03:44:16,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:16,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 03:44:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 03:44:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:44:16,723 INFO L87 Difference]: Start difference. First operand 8212 states and 18398 transitions. Second operand 9 states. [2018-12-03 03:44:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:17,114 INFO L93 Difference]: Finished difference Result 12530 states and 28025 transitions. [2018-12-03 03:44:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 03:44:17,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-03 03:44:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:17,120 INFO L225 Difference]: With dead ends: 12530 [2018-12-03 03:44:17,120 INFO L226 Difference]: Without dead ends: 9319 [2018-12-03 03:44:17,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-03 03:44:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2018-12-03 03:44:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 8269. [2018-12-03 03:44:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2018-12-03 03:44:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 18515 transitions. [2018-12-03 03:44:17,177 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 18515 transitions. Word has length 98 [2018-12-03 03:44:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:17,177 INFO L480 AbstractCegarLoop]: Abstraction has 8269 states and 18515 transitions. [2018-12-03 03:44:17,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 03:44:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 18515 transitions. [2018-12-03 03:44:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:17,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:17,182 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-03 03:44:17,182 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:17,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -543309766, now seen corresponding path program 1 times [2018-12-03 03:44:17,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:17,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:17,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:17,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:17,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:17,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:17,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:17,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:17,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:17,267 INFO L87 Difference]: Start difference. First operand 8269 states and 18515 transitions. Second operand 6 states. [2018-12-03 03:44:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:17,375 INFO L93 Difference]: Finished difference Result 9209 states and 20352 transitions. [2018-12-03 03:44:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:44:17,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-03 03:44:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:17,381 INFO L225 Difference]: With dead ends: 9209 [2018-12-03 03:44:17,381 INFO L226 Difference]: Without dead ends: 9152 [2018-12-03 03:44:17,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9152 states. [2018-12-03 03:44:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9152 to 8173. [2018-12-03 03:44:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8173 states. [2018-12-03 03:44:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8173 states to 8173 states and 18170 transitions. [2018-12-03 03:44:17,441 INFO L78 Accepts]: Start accepts. Automaton has 8173 states and 18170 transitions. Word has length 98 [2018-12-03 03:44:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:17,441 INFO L480 AbstractCegarLoop]: Abstraction has 8173 states and 18170 transitions. [2018-12-03 03:44:17,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8173 states and 18170 transitions. [2018-12-03 03:44:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:17,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:44:17,446 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1661772762, now seen corresponding path program 2 times [2018-12-03 03:44:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:17,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:17,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:44:17,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:17,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:44:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:44:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:44:17,491 INFO L87 Difference]: Start difference. First operand 8173 states and 18170 transitions. Second operand 6 states. [2018-12-03 03:44:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:17,601 INFO L93 Difference]: Finished difference Result 8417 states and 18664 transitions. [2018-12-03 03:44:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:44:17,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-03 03:44:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:17,606 INFO L225 Difference]: With dead ends: 8417 [2018-12-03 03:44:17,607 INFO L226 Difference]: Without dead ends: 8417 [2018-12-03 03:44:17,607 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-03 03:44:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8417 states. [2018-12-03 03:44:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8417 to 8092. [2018-12-03 03:44:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8092 states. [2018-12-03 03:44:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 17987 transitions. [2018-12-03 03:44:17,679 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 17987 transitions. Word has length 98 [2018-12-03 03:44:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:17,680 INFO L480 AbstractCegarLoop]: Abstraction has 8092 states and 17987 transitions. [2018-12-03 03:44:17,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:44:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 17987 transitions. [2018-12-03 03:44:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:17,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:17,685 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-03 03:44:17,685 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:17,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-12-03 03:44:17,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 03:44:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:17,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:17,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 03:44:17,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:17,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 03:44:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 03:44:17,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:44:17,754 INFO L87 Difference]: Start difference. First operand 8092 states and 17987 transitions. Second operand 9 states. [2018-12-03 03:44:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:17,852 INFO L93 Difference]: Finished difference Result 12168 states and 27134 transitions. [2018-12-03 03:44:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 03:44:17,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-03 03:44:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:17,855 INFO L225 Difference]: With dead ends: 12168 [2018-12-03 03:44:17,855 INFO L226 Difference]: Without dead ends: 4321 [2018-12-03 03:44:17,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-03 03:44:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2018-12-03 03:44:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4321. [2018-12-03 03:44:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2018-12-03 03:44:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 9622 transitions. [2018-12-03 03:44:17,880 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 9622 transitions. Word has length 98 [2018-12-03 03:44:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:17,880 INFO L480 AbstractCegarLoop]: Abstraction has 4321 states and 9622 transitions. [2018-12-03 03:44:17,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 03:44:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 9622 transitions. [2018-12-03 03:44:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:17,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:17,883 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-03 03:44:17,883 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:17,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 3 times [2018-12-03 03:44:17,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 03:44:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:17,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:17,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:17,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 03:44:17,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:17,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 03:44:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 03:44:17,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:44:17,982 INFO L87 Difference]: Start difference. First operand 4321 states and 9622 transitions. Second operand 11 states. [2018-12-03 03:44:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:18,674 INFO L93 Difference]: Finished difference Result 8451 states and 18965 transitions. [2018-12-03 03:44:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 03:44:18,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-03 03:44:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:18,679 INFO L225 Difference]: With dead ends: 8451 [2018-12-03 03:44:18,680 INFO L226 Difference]: Without dead ends: 5653 [2018-12-03 03:44:18,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-12-03 03:44:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2018-12-03 03:44:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 4354. [2018-12-03 03:44:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4354 states. [2018-12-03 03:44:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 9648 transitions. [2018-12-03 03:44:18,715 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 9648 transitions. Word has length 98 [2018-12-03 03:44:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:18,715 INFO L480 AbstractCegarLoop]: Abstraction has 4354 states and 9648 transitions. [2018-12-03 03:44:18,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 03:44:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 9648 transitions. [2018-12-03 03:44:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:18,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:18,718 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-03 03:44:18,718 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:18,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1302782348, now seen corresponding path program 1 times [2018-12-03 03:44:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:18,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 03:44:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:18,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:44:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:44:18,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:44:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 03:44:18,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:44:18,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:44:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:44:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:44:18,791 INFO L87 Difference]: Start difference. First operand 4354 states and 9648 transitions. Second operand 7 states. [2018-12-03 03:44:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:44:18,940 INFO L93 Difference]: Finished difference Result 4594 states and 10120 transitions. [2018-12-03 03:44:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 03:44:18,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-03 03:44:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:44:18,943 INFO L225 Difference]: With dead ends: 4594 [2018-12-03 03:44:18,944 INFO L226 Difference]: Without dead ends: 4594 [2018-12-03 03:44:18,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 03:44:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2018-12-03 03:44:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4400. [2018-12-03 03:44:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4400 states. [2018-12-03 03:44:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 9735 transitions. [2018-12-03 03:44:18,972 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 9735 transitions. Word has length 98 [2018-12-03 03:44:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:44:18,972 INFO L480 AbstractCegarLoop]: Abstraction has 4400 states and 9735 transitions. [2018-12-03 03:44:18,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:44:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 9735 transitions. [2018-12-03 03:44:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 03:44:18,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:44:18,975 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-03 03:44:18,975 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:44:18,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:44:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1271762541, now seen corresponding path program 4 times [2018-12-03 03:44:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:44:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:44:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:44:18,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:44:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 03:44:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 03:44:19,012 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 03:44:19,081 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 03:44:19,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:44:19 BasicIcfg [2018-12-03 03:44:19,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:44:19,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:44:19,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:44:19,083 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:44:19,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:44:01" (3/4) ... [2018-12-03 03:44:19,084 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 03:44:19,163 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_72d20192-2cec-42ce-a1e3-eb4bec7749d4/bin-2019/utaipan/witness.graphml [2018-12-03 03:44:19,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:44:19,163 INFO L168 Benchmark]: Toolchain (without parser) took 18730.85 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 951.7 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 890.3 MB. Max. memory is 11.5 GB. [2018-12-03 03:44:19,164 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:44:19,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-03 03:44:19,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-03 03:44:19,165 INFO L168 Benchmark]: Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:44:19,165 INFO L168 Benchmark]: RCFGBuilder took 333.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-12-03 03:44:19,165 INFO L168 Benchmark]: TraceAbstraction took 17947.39 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 815.4 MB. Max. memory is 11.5 GB. [2018-12-03 03:44:19,165 INFO L168 Benchmark]: Witness Printer took 80.53 ms. Allocated memory is still 3.1 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2018-12-03 03:44:19,166 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17947.39 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 815.4 MB. Max. memory is 11.5 GB. * Witness Printer took 80.53 ms. Allocated memory is still 3.1 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 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] [L788] FCALL, FORK -1 pthread_create(&t252, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, 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] [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=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] 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, 17.8s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9381 SDtfs, 10431 SDslu, 20855 SDs, 0 SdLazy, 8360 SolverSat, 490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 94 SyntacticMatches, 29 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.8s 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: 5.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 88725 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2937 NumberOfCodeBlocks, 2937 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2803 ConstructedInterpolants, 0 QuantifiedInterpolants, 628026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...