./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:56:57,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:56:57,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:56:57,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:56:57,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:56:57,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:56:57,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:56:57,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:56:57,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:56:57,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:56:57,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:56:57,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:56:57,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:56:57,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:56:57,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:56:57,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:56:57,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:56:57,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:56:57,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:56:57,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:56:57,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:56:57,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:56:57,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:56:57,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:56:57,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:56:57,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:56:57,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:56:57,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:56:57,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:56:57,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:56:57,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:56:57,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:56:57,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:56:57,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:56:57,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:56:57,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:56:57,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:56:57,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:56:57,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:56:57,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:56:57,051 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:56:57,051 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:56:57,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:56:57,052 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:56:57,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:56:57,052 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:56:57,052 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:56:57,052 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:56:57,052 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:56:57,053 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:56:57,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:56:57,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:56:57,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:56:57,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:56:57,054 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:56:57,055 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:56:57,055 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:56:57,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:56:57,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:56:57,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:56:57,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:56:57,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:56:57,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:56:57,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:56:57,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:56:57,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:56:57,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:56:57,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:56:57,056 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_bdb551d7-899c-4edf-a25d-93441652995b/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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-23 02:56:57,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:56:57,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:56:57,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:56:57,089 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:56:57,089 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:56:57,090 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 02:56:57,125 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/data/352403447/96cb76110e5444498b745a0f3a5dc42f/FLAG2e3e6d70a [2018-11-23 02:56:57,456 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:56:57,457 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 02:56:57,461 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/data/352403447/96cb76110e5444498b745a0f3a5dc42f/FLAG2e3e6d70a [2018-11-23 02:56:57,469 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/data/352403447/96cb76110e5444498b745a0f3a5dc42f [2018-11-23 02:56:57,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:56:57,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:56:57,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:56:57,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:56:57,476 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:56:57,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57, skipping insertion in model container [2018-11-23 02:56:57,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:56:57,502 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:56:57,608 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:56:57,611 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:56:57,624 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:56:57,633 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:56:57,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57 WrapperNode [2018-11-23 02:56:57,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:56:57,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:56:57,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:56:57,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:56:57,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:56:57,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:56:57,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:56:57,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:56:57,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... [2018-11-23 02:56:57,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:56:57,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:56:57,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:56:57,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:56:57,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/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-11-23 02:56:57,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:56:57,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:56:57,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:56:57,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:56:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:56:57,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:56:57,859 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:56:57,859 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 02:56:57,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:57 BoogieIcfgContainer [2018-11-23 02:56:57,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:56:57,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:56:57,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:56:57,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:56:57,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:56:57" (1/3) ... [2018-11-23 02:56:57,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd8bce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:57, skipping insertion in model container [2018-11-23 02:56:57,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57" (2/3) ... [2018-11-23 02:56:57,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd8bce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:57, skipping insertion in model container [2018-11-23 02:56:57,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:57" (3/3) ... [2018-11-23 02:56:57,866 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 02:56:57,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:56:57,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:56:57,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:56:57,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:56:57,903 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:56:57,903 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:56:57,903 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:56:57,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:56:57,903 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:56:57,903 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:56:57,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:56:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 02:56:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 02:56:57,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:57,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:57,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:57,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-11-23 02:56:57,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:57,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:57,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,052 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 02:56:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,091 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-11-23 02:56:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 02:56:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,101 INFO L225 Difference]: With dead ends: 63 [2018-11-23 02:56:58,101 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:56:58,103 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-11-23 02:56:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:56:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-23 02:56:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:56:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-11-23 02:56:58,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-11-23 02:56:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,131 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-11-23 02:56:58,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-11-23 02:56:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 02:56:58,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,133 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-11-23 02:56:58,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,168 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-11-23 02:56:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,201 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-23 02:56:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 02:56:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,202 INFO L225 Difference]: With dead ends: 77 [2018-11-23 02:56:58,202 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:56:58,202 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-11-23 02:56:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:56:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 02:56:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:56:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-11-23 02:56:58,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-11-23 02:56:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,206 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-11-23 02:56:58,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-11-23 02:56:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 02:56:58,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,207 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-11-23 02:56:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,236 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,237 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-11-23 02:56:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,252 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-11-23 02:56:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 02:56:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,253 INFO L225 Difference]: With dead ends: 72 [2018-11-23 02:56:58,253 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 02:56:58,253 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-11-23 02:56:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 02:56:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 02:56:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 02:56:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-11-23 02:56:58,258 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-11-23 02:56:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,258 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-11-23 02:56:58,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-11-23 02:56:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 02:56:58,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,259 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-11-23 02:56:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,296 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-11-23 02:56:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,306 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-11-23 02:56:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 02:56:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,307 INFO L225 Difference]: With dead ends: 88 [2018-11-23 02:56:58,307 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 02:56:58,308 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-11-23 02:56:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 02:56:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-11-23 02:56:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 02:56:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-11-23 02:56:58,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-11-23 02:56:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,313 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-11-23 02:56:58,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-11-23 02:56:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 02:56:58,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-11-23 02:56:58,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,333 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-11-23 02:56:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,364 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-11-23 02:56:58,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 02:56:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,366 INFO L225 Difference]: With dead ends: 144 [2018-11-23 02:56:58,366 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 02:56:58,366 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-11-23 02:56:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 02:56:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-23 02:56:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 02:56:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-11-23 02:56:58,373 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-11-23 02:56:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,373 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-11-23 02:56:58,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-11-23 02:56:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:56:58,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,375 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-11-23 02:56:58,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,391 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-11-23 02:56:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,407 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-11-23 02:56:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 02:56:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,408 INFO L225 Difference]: With dead ends: 129 [2018-11-23 02:56:58,408 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 02:56:58,408 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-11-23 02:56:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 02:56:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 02:56:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 02:56:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-11-23 02:56:58,412 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-11-23 02:56:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,413 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-11-23 02:56:58,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-11-23 02:56:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:56:58,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-11-23 02:56:58,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,431 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-11-23 02:56:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,444 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-11-23 02:56:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 02:56:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,445 INFO L225 Difference]: With dead ends: 156 [2018-11-23 02:56:58,445 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 02:56:58,445 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-11-23 02:56:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 02:56:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-11-23 02:56:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 02:56:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-11-23 02:56:58,454 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-11-23 02:56:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,454 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-11-23 02:56:58,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-11-23 02:56:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:56:58,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-11-23 02:56:58,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,485 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-11-23 02:56:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,499 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-11-23 02:56:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 02:56:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,500 INFO L225 Difference]: With dead ends: 272 [2018-11-23 02:56:58,500 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 02:56:58,501 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-11-23 02:56:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 02:56:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 02:56:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 02:56:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-11-23 02:56:58,509 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-11-23 02:56:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,510 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-11-23 02:56:58,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-11-23 02:56:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:56:58,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,511 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-11-23 02:56:58,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,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-11-23 02:56:58,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,540 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-11-23 02:56:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,559 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-11-23 02:56:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 02:56:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,560 INFO L225 Difference]: With dead ends: 240 [2018-11-23 02:56:58,560 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 02:56:58,561 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-11-23 02:56:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 02:56:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-23 02:56:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 02:56:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-11-23 02:56:58,569 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-11-23 02:56:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,569 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-11-23 02:56:58,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-11-23 02:56:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:56:58,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,570 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-11-23 02:56:58,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,604 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-11-23 02:56:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,629 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-11-23 02:56:58,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 02:56:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,631 INFO L225 Difference]: With dead ends: 284 [2018-11-23 02:56:58,631 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 02:56:58,631 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-11-23 02:56:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 02:56:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-11-23 02:56:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 02:56:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-11-23 02:56:58,639 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-11-23 02:56:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,640 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-11-23 02:56:58,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-11-23 02:56:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:56:58,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,641 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-11-23 02:56:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,655 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-11-23 02:56:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,678 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-11-23 02:56:58,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 02:56:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,680 INFO L225 Difference]: With dead ends: 524 [2018-11-23 02:56:58,680 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 02:56:58,681 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-11-23 02:56:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 02:56:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 02:56:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 02:56:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-11-23 02:56:58,688 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-11-23 02:56:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,689 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-11-23 02:56:58,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-11-23 02:56:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:56:58,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,690 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] [2018-11-23 02:56:58,690 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-11-23 02:56:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,725 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-11-23 02:56:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,736 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-11-23 02:56:58,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 02:56:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,737 INFO L225 Difference]: With dead ends: 456 [2018-11-23 02:56:58,737 INFO L226 Difference]: Without dead ends: 314 [2018-11-23 02:56:58,738 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-11-23 02:56:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-23 02:56:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-11-23 02:56:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 02:56:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-11-23 02:56:58,750 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-11-23 02:56:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,750 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-11-23 02:56:58,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-11-23 02:56:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:56:58,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,751 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] [2018-11-23 02:56:58,752 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-11-23 02:56:58,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,767 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-11-23 02:56:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,785 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-11-23 02:56:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 02:56:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,787 INFO L225 Difference]: With dead ends: 524 [2018-11-23 02:56:58,788 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 02:56:58,788 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-11-23 02:56:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 02:56:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-11-23 02:56:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 02:56:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-11-23 02:56:58,804 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-11-23 02:56:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,804 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-11-23 02:56:58,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-11-23 02:56:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:56:58,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,805 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] [2018-11-23 02:56:58,806 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-11-23 02:56:58,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,841 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-11-23 02:56:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,873 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-11-23 02:56:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 02:56:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,875 INFO L225 Difference]: With dead ends: 1020 [2018-11-23 02:56:58,875 INFO L226 Difference]: Without dead ends: 586 [2018-11-23 02:56:58,876 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-11-23 02:56:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-23 02:56:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-11-23 02:56:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 02:56:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-11-23 02:56:58,898 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-11-23 02:56:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,898 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-11-23 02:56:58,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-11-23 02:56:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:56:58,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:56:58,900 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-11-23 02:56:58,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,916 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-11-23 02:56:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:58,939 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-11-23 02:56:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:58,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 02:56:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:58,941 INFO L225 Difference]: With dead ends: 876 [2018-11-23 02:56:58,941 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 02:56:58,942 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-11-23 02:56:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 02:56:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 02:56:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 02:56:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-11-23 02:56:58,956 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-11-23 02:56:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:58,957 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-11-23 02:56:58,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-11-23 02:56:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:56:58,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:58,958 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] [2018-11-23 02:56:58,958 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:58,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-11-23 02:56:58,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:58,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:58,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:58,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:58,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:58,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:58,992 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-11-23 02:56:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:59,017 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-11-23 02:56:59,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:59,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 02:56:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:59,020 INFO L225 Difference]: With dead ends: 970 [2018-11-23 02:56:59,020 INFO L226 Difference]: Without dead ends: 968 [2018-11-23 02:56:59,021 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-11-23 02:56:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-23 02:56:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-11-23 02:56:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 02:56:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-11-23 02:56:59,039 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-11-23 02:56:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:59,039 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-11-23 02:56:59,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-11-23 02:56:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:56:59,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:56:59,040 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] [2018-11-23 02:56:59,041 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:56:59,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:56:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-11-23 02:56:59,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:56:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:56:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:56:59,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:56:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:56:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:56:59,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:56:59,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:56:59,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:56:59,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:56:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:56:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:56:59,064 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-11-23 02:56:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:56:59,093 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-11-23 02:56:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:56:59,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 02:56:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:56:59,094 INFO L225 Difference]: With dead ends: 1992 [2018-11-23 02:56:59,094 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:56:59,096 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-11-23 02:56:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:56:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:56:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:56:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:56:59,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 02:56:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:56:59,097 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:56:59,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:56:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:56:59,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:56:59,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:56:59,122 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 02:56:59,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:56:59,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:56:59,122 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:56:59,122 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:56:59,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:56:59,122 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-23 02:56:59,122 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,123 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-23 02:56:59,123 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-23 02:56:59,124 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,125 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 02:56:59,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:56:59 BoogieIcfgContainer [2018-11-23 02:56:59,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:56:59,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:56:59,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:56:59,134 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:56:59,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:57" (3/4) ... [2018-11-23 02:56:59,137 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:56:59,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:56:59,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:56:59,145 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 02:56:59,146 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 02:56:59,146 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:56:59,184 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bdb551d7-899c-4edf-a25d-93441652995b/bin-2019/utaipan/witness.graphml [2018-11-23 02:56:59,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:56:59,185 INFO L168 Benchmark]: Toolchain (without parser) took 1713.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 958.0 MB in the beginning and 912.1 MB in the end (delta: 46.0 MB). Peak memory consumption was 190.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:59,186 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:56:59,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.57 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:59,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.99 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:59,186 INFO L168 Benchmark]: Boogie Preprocessor took 12.98 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:56:59,186 INFO L168 Benchmark]: RCFGBuilder took 200.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:59,187 INFO L168 Benchmark]: TraceAbstraction took 1273.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.0 MB in the end (delta: 204.7 MB). Peak memory consumption was 204.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:59,187 INFO L168 Benchmark]: Witness Printer took 50.10 ms. Allocated memory is still 1.2 GB. Free memory was 919.0 MB in the beginning and 912.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:56:59,188 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.57 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.99 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.98 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1273.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.0 MB in the end (delta: 204.7 MB). Peak memory consumption was 204.7 MB. Max. memory is 11.5 GB. * Witness Printer took 50.10 ms. Allocated memory is still 1.2 GB. Free memory was 919.0 MB in the beginning and 912.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 1.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, 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: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...