./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/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_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/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-1dbac8b [2018-11-10 07:00:04,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:00:04,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:00:04,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:00:04,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:00:04,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:00:04,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:00:04,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:00:04,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:00:04,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:00:04,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:00:04,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:00:04,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:00:04,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:00:04,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:00:04,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:00:04,906 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:00:04,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:00:04,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:00:04,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:00:04,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:00:04,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:00:04,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:00:04,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:00:04,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:00:04,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:00:04,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:00:04,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:00:04,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:00:04,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:00:04,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:00:04,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:00:04,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:00:04,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:00:04,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:00:04,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:00:04,921 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:00:04,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:00:04,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:00:04,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:00:04,931 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:00:04,932 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:00:04,932 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:00:04,932 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:00:04,932 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:00:04,932 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:00:04,933 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:00:04,933 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:00:04,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:00:04,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:00:04,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:00:04,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:00:04,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:00:04,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:00:04,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:00:04,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:00:04,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:00:04,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:00:04,935 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:00:04,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:00:04,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:00:04,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:00:04,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:00:04,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:00:04,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:00:04,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:00:04,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:00:04,937 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:00:04,937 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:00:04,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:00:04,937 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:00:04,937 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_7efd8a4c-f4ad-441d-961c-338d54fcadba/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-10 07:00:04,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:00:04,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:00:04,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:00:04,985 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:00:04,985 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:00:04,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:00:05,046 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/data/cc44aa854/b11f38f7da5d41eb9dc09c9405d199bc/FLAG46339d29e [2018-11-10 07:00:05,410 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:00:05,411 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:00:05,418 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/data/cc44aa854/b11f38f7da5d41eb9dc09c9405d199bc/FLAG46339d29e [2018-11-10 07:00:05,429 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/data/cc44aa854/b11f38f7da5d41eb9dc09c9405d199bc [2018-11-10 07:00:05,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:00:05,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:00:05,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:00:05,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:00:05,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:00:05,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05, skipping insertion in model container [2018-11-10 07:00:05,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:00:05,474 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:00:05,626 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:00:05,630 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:00:05,649 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:00:05,661 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:00:05,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05 WrapperNode [2018-11-10 07:00:05,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:00:05,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:00:05,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:00:05,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:00:05,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:00:05,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:00:05,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:00:05,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:00:05,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... [2018-11-10 07:00:05,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:00:05,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:00:05,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:00:05,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:00:05,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/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-10 07:00:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:00:05,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:00:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:00:05,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:00:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:00:05,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:00:05,959 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:00:05,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:00:05 BoogieIcfgContainer [2018-11-10 07:00:05,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:00:05,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:00:05,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:00:05,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:00:05,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:00:05" (1/3) ... [2018-11-10 07:00:05,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d95ba62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:05, skipping insertion in model container [2018-11-10 07:00:05,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:05" (2/3) ... [2018-11-10 07:00:05,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d95ba62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:05, skipping insertion in model container [2018-11-10 07:00:05,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:00:05" (3/3) ... [2018-11-10 07:00:05,969 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:00:05,979 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:00:05,988 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:00:06,004 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:00:06,033 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:00:06,033 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:00:06,033 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:00:06,033 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:00:06,033 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:00:06,034 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:00:06,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:00:06,034 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:00:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 07:00:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 07:00:06,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,055 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1169713633, now seen corresponding path program 1 times [2018-11-10 07:00:06,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,102 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,202 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-10 07:00:06,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,206 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,223 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-11-10 07:00:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,265 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2018-11-10 07:00:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-10 07:00:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,276 INFO L225 Difference]: With dead ends: 65 [2018-11-10 07:00:06,276 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 07:00:06,279 INFO L605 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-10 07:00:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 07:00:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-10 07:00:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 07:00:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2018-11-10 07:00:06,311 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2018-11-10 07:00:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,311 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2018-11-10 07:00:06,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2018-11-10 07:00:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 07:00:06,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,313 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1849772003, now seen corresponding path program 1 times [2018-11-10 07:00:06,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:06,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,363 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 3 states. [2018-11-10 07:00:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,392 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2018-11-10 07:00:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-10 07:00:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,394 INFO L225 Difference]: With dead ends: 80 [2018-11-10 07:00:06,395 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 07:00:06,396 INFO L605 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-10 07:00:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 07:00:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-10 07:00:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 07:00:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 79 transitions. [2018-11-10 07:00:06,403 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 79 transitions. Word has length 17 [2018-11-10 07:00:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,403 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 79 transitions. [2018-11-10 07:00:06,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2018-11-10 07:00:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:00:06,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,404 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1901598932, now seen corresponding path program 1 times [2018-11-10 07:00:06,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,444 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-10 07:00:06,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,445 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,446 INFO L87 Difference]: Start difference. First operand 48 states and 79 transitions. Second operand 3 states. [2018-11-10 07:00:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,470 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2018-11-10 07:00:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 07:00:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,471 INFO L225 Difference]: With dead ends: 76 [2018-11-10 07:00:06,472 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 07:00:06,472 INFO L605 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-10 07:00:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 07:00:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-10 07:00:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 07:00:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2018-11-10 07:00:06,479 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 18 [2018-11-10 07:00:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,480 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 82 transitions. [2018-11-10 07:00:06,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2018-11-10 07:00:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:00:06,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,481 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1508571922, now seen corresponding path program 1 times [2018-11-10 07:00:06,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,483 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,512 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-10 07:00:06,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,512 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,513 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. Second operand 3 states. [2018-11-10 07:00:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,539 INFO L93 Difference]: Finished difference Result 93 states and 149 transitions. [2018-11-10 07:00:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 07:00:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,541 INFO L225 Difference]: With dead ends: 93 [2018-11-10 07:00:06,541 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 07:00:06,542 INFO L605 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-10 07:00:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 07:00:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-11-10 07:00:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 07:00:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2018-11-10 07:00:06,550 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 18 [2018-11-10 07:00:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,550 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2018-11-10 07:00:06,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2018-11-10 07:00:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:00:06,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,552 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2106337004, now seen corresponding path program 1 times [2018-11-10 07:00:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:06,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,587 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,588 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2018-11-10 07:00:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,605 INFO L93 Difference]: Finished difference Result 151 states and 245 transitions. [2018-11-10 07:00:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 07:00:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,606 INFO L225 Difference]: With dead ends: 151 [2018-11-10 07:00:06,606 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 07:00:06,606 INFO L605 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-10 07:00:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 07:00:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-10 07:00:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 07:00:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2018-11-10 07:00:06,612 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 18 [2018-11-10 07:00:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,612 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2018-11-10 07:00:06,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2018-11-10 07:00:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 07:00:06,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,613 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash -478695656, now seen corresponding path program 1 times [2018-11-10 07:00:06,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,635 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-10 07:00:06,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,637 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand 3 states. [2018-11-10 07:00:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,658 INFO L93 Difference]: Finished difference Result 136 states and 212 transitions. [2018-11-10 07:00:06,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 07:00:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,660 INFO L225 Difference]: With dead ends: 136 [2018-11-10 07:00:06,660 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 07:00:06,661 INFO L605 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-10 07:00:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 07:00:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-10 07:00:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 07:00:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2018-11-10 07:00:06,670 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2018-11-10 07:00:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,670 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2018-11-10 07:00:06,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2018-11-10 07:00:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 07:00:06,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,672 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash -871722666, now seen corresponding path program 1 times [2018-11-10 07:00:06,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,696 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-10 07:00:06,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,698 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand 3 states. [2018-11-10 07:00:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,711 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2018-11-10 07:00:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 07:00:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,713 INFO L225 Difference]: With dead ends: 165 [2018-11-10 07:00:06,713 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 07:00:06,714 INFO L605 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-10 07:00:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 07:00:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-11-10 07:00:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 07:00:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2018-11-10 07:00:06,724 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 19 [2018-11-10 07:00:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,725 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2018-11-10 07:00:06,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2018-11-10 07:00:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 07:00:06,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:06,728 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash -191664296, now seen corresponding path program 1 times [2018-11-10 07:00:06,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,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-10 07:00:06,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,767 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,768 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand 3 states. [2018-11-10 07:00:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,802 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2018-11-10 07:00:06,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 07:00:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,805 INFO L225 Difference]: With dead ends: 285 [2018-11-10 07:00:06,805 INFO L226 Difference]: Without dead ends: 171 [2018-11-10 07:00:06,806 INFO L605 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-10 07:00:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-10 07:00:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-11-10 07:00:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-10 07:00:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2018-11-10 07:00:06,819 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 19 [2018-11-10 07:00:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,819 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2018-11-10 07:00:06,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2018-11-10 07:00:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:00:06,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,820 INFO L375 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-10 07:00:06,821 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1253383511, now seen corresponding path program 1 times [2018-11-10 07:00:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,845 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-10 07:00:06,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,846 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,847 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 3 states. [2018-11-10 07:00:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,874 INFO L93 Difference]: Finished difference Result 253 states and 373 transitions. [2018-11-10 07:00:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:00:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,876 INFO L225 Difference]: With dead ends: 253 [2018-11-10 07:00:06,876 INFO L226 Difference]: Without dead ends: 175 [2018-11-10 07:00:06,877 INFO L605 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-10 07:00:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-10 07:00:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-11-10 07:00:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 07:00:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2018-11-10 07:00:06,888 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 20 [2018-11-10 07:00:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,888 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2018-11-10 07:00:06,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2018-11-10 07:00:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:00:06,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,891 INFO L375 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-10 07:00:06,891 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1646410521, now seen corresponding path program 1 times [2018-11-10 07:00:06,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:06,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,926 INFO L87 Difference]: Start difference. First operand 173 states and 251 transitions. Second operand 3 states. [2018-11-10 07:00:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:06,950 INFO L93 Difference]: Finished difference Result 301 states and 441 transitions. [2018-11-10 07:00:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:06,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:00:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:06,951 INFO L225 Difference]: With dead ends: 301 [2018-11-10 07:00:06,952 INFO L226 Difference]: Without dead ends: 299 [2018-11-10 07:00:06,952 INFO L605 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-10 07:00:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-10 07:00:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 241. [2018-11-10 07:00:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 07:00:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 343 transitions. [2018-11-10 07:00:06,964 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 343 transitions. Word has length 20 [2018-11-10 07:00:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:06,964 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 343 transitions. [2018-11-10 07:00:06,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 343 transitions. [2018-11-10 07:00:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:00:06,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:06,965 INFO L375 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-10 07:00:06,966 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:06,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:06,966 INFO L82 PathProgramCache]: Analyzing trace with hash -966352151, now seen corresponding path program 1 times [2018-11-10 07:00:06,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:06,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:06,982 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-10 07:00:06,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:06,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:06,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:06,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:06,983 INFO L87 Difference]: Start difference. First operand 241 states and 343 transitions. Second operand 3 states. [2018-11-10 07:00:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:07,002 INFO L93 Difference]: Finished difference Result 549 states and 777 transitions. [2018-11-10 07:00:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:07,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:00:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:07,006 INFO L225 Difference]: With dead ends: 549 [2018-11-10 07:00:07,006 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 07:00:07,008 INFO L605 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-10 07:00:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 07:00:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-11-10 07:00:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-10 07:00:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 439 transitions. [2018-11-10 07:00:07,019 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 439 transitions. Word has length 20 [2018-11-10 07:00:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:07,020 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 439 transitions. [2018-11-10 07:00:07,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 439 transitions. [2018-11-10 07:00:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:00:07,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:07,021 INFO L375 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-10 07:00:07,021 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:07,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:07,022 INFO L82 PathProgramCache]: Analyzing trace with hash 501097101, now seen corresponding path program 1 times [2018-11-10 07:00:07,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:07,045 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-10 07:00:07,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:07,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:07,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:07,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:07,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:07,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:07,046 INFO L87 Difference]: Start difference. First operand 321 states and 439 transitions. Second operand 3 states. [2018-11-10 07:00:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:07,063 INFO L93 Difference]: Finished difference Result 481 states and 653 transitions. [2018-11-10 07:00:07,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:07,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:00:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:07,065 INFO L225 Difference]: With dead ends: 481 [2018-11-10 07:00:07,065 INFO L226 Difference]: Without dead ends: 331 [2018-11-10 07:00:07,066 INFO L605 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-10 07:00:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-10 07:00:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-11-10 07:00:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-10 07:00:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 439 transitions. [2018-11-10 07:00:07,080 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 439 transitions. Word has length 21 [2018-11-10 07:00:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:07,081 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 439 transitions. [2018-11-10 07:00:07,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 439 transitions. [2018-11-10 07:00:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:00:07,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:07,084 INFO L375 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-10 07:00:07,084 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:07,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 108070091, now seen corresponding path program 1 times [2018-11-10 07:00:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:07,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:07,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:07,122 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-10 07:00:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:07,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:07,123 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:07,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:07,124 INFO L87 Difference]: Start difference. First operand 329 states and 439 transitions. Second operand 3 states. [2018-11-10 07:00:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:07,159 INFO L93 Difference]: Finished difference Result 925 states and 1209 transitions. [2018-11-10 07:00:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:07,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:00:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:07,162 INFO L225 Difference]: With dead ends: 925 [2018-11-10 07:00:07,163 INFO L226 Difference]: Without dead ends: 619 [2018-11-10 07:00:07,164 INFO L605 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-10 07:00:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-10 07:00:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-10 07:00:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-10 07:00:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 775 transitions. [2018-11-10 07:00:07,193 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 775 transitions. Word has length 21 [2018-11-10 07:00:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:07,194 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 775 transitions. [2018-11-10 07:00:07,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 775 transitions. [2018-11-10 07:00:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:00:07,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:07,195 INFO L375 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-10 07:00:07,196 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:07,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash -571988279, now seen corresponding path program 1 times [2018-11-10 07:00:07,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:07,215 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-10 07:00:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:07,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:07,216 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:07,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:07,217 INFO L87 Difference]: Start difference. First operand 617 states and 775 transitions. Second operand 3 states. [2018-11-10 07:00:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:07,257 INFO L93 Difference]: Finished difference Result 701 states and 889 transitions. [2018-11-10 07:00:07,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:07,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:00:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:07,260 INFO L225 Difference]: With dead ends: 701 [2018-11-10 07:00:07,261 INFO L226 Difference]: Without dead ends: 699 [2018-11-10 07:00:07,261 INFO L605 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-10 07:00:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-11-10 07:00:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 617. [2018-11-10 07:00:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-10 07:00:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 759 transitions. [2018-11-10 07:00:07,288 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 759 transitions. Word has length 21 [2018-11-10 07:00:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:07,288 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 759 transitions. [2018-11-10 07:00:07,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 759 transitions. [2018-11-10 07:00:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:00:07,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:07,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:07,290 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:07,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -944578434, now seen corresponding path program 1 times [2018-11-10 07:00:07,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:07,310 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-10 07:00:07,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:07,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:07,310 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:07,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:07,311 INFO L87 Difference]: Start difference. First operand 617 states and 759 transitions. Second operand 3 states. [2018-11-10 07:00:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:07,350 INFO L93 Difference]: Finished difference Result 1019 states and 1240 transitions. [2018-11-10 07:00:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:07,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:00:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:07,355 INFO L225 Difference]: With dead ends: 1019 [2018-11-10 07:00:07,355 INFO L226 Difference]: Without dead ends: 1017 [2018-11-10 07:00:07,356 INFO L605 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-10 07:00:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-11-10 07:00:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 921. [2018-11-10 07:00:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-10 07:00:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1111 transitions. [2018-11-10 07:00:07,395 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1111 transitions. Word has length 22 [2018-11-10 07:00:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:07,396 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 1111 transitions. [2018-11-10 07:00:07,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1111 transitions. [2018-11-10 07:00:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:00:07,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:07,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:07,400 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:00:07,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash -264520064, now seen corresponding path program 1 times [2018-11-10 07:00:07,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:00:07,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:07,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:00:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:07,420 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-10 07:00:07,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:07,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:07,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:00:07,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:07,423 INFO L87 Difference]: Start difference. First operand 921 states and 1111 transitions. Second operand 3 states. [2018-11-10 07:00:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:07,502 INFO L93 Difference]: Finished difference Result 2073 states and 2455 transitions. [2018-11-10 07:00:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:07,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:00:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:07,503 INFO L225 Difference]: With dead ends: 2073 [2018-11-10 07:00:07,503 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:00:07,506 INFO L605 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-10 07:00:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:00:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:00:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:00:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:00:07,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-10 07:00:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:07,508 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:00:07,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:00:07,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:00:07,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:00:07,537 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:00:07,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:00:07,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:00:07,538 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:00:07,538 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:00:07,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:00:07,538 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-10 07:00:07,538 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,538 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L428 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-10 07:00:07,539 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-10 07:00:07,540 INFO L425 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,540 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-10 07:00:07,540 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 07:00:07,540 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,540 INFO L428 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-10 07:00:07,540 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 07:00:07,540 INFO L425 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-10 07:00:07,540 INFO L421 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-10 07:00:07,540 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,541 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,545 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,545 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-10 07:00:07,546 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,546 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-10 07:00:07,546 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-10 07:00:07,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:00:07 BoogieIcfgContainer [2018-11-10 07:00:07,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:00:07,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:00:07,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:00:07,562 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:00:07,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:00:05" (3/4) ... [2018-11-10 07:00:07,568 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:00:07,575 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:00:07,576 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:00:07,581 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 07:00:07,581 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:00:07,582 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:00:07,635 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7efd8a4c-f4ad-441d-961c-338d54fcadba/bin-2019/utaipan/witness.graphml [2018-11-10 07:00:07,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:00:07,637 INFO L168 Benchmark]: Toolchain (without parser) took 2203.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 959.2 MB in the beginning and 928.7 MB in the end (delta: 30.6 MB). Peak memory consumption was 169.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:07,639 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:00:07,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:07,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.03 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:00:07,640 INFO L168 Benchmark]: Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:07,640 INFO L168 Benchmark]: RCFGBuilder took 259.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:07,640 INFO L168 Benchmark]: TraceAbstraction took 1600.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 934.1 MB in the end (delta: 187.5 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:07,641 INFO L168 Benchmark]: Witness Printer took 74.25 ms. Allocated memory is still 1.2 GB. Free memory was 934.1 MB in the beginning and 928.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:07,643 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 228.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 17.03 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 259.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1600.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 934.1 MB in the end (delta: 187.5 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.25 ms. Allocated memory is still 1.2 GB. Free memory was 934.1 MB in the beginning and 928.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 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, 33 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 907 SDtfs, 408 SDslu, 595 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=15, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 331 StatesRemovedByMinimization, 15 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 9734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...