./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:23:26,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:23:26,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:23:26,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:23:26,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:23:26,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:23:26,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:23:26,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:23:26,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:23:26,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:23:26,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:23:26,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:23:26,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:23:26,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:23:26,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:23:26,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:23:26,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:23:26,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:23:26,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:23:26,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:23:26,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:23:26,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:23:26,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:23:26,790 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:23:26,790 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:23:26,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:23:26,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:23:26,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:23:26,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:23:26,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:23:26,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:23:26,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:23:26,794 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:23:26,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:23:26,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:23:26,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:23:26,795 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 02:23:26,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:23:26,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:23:26,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 02:23:26,806 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 02:23:26,806 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 02:23:26,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:23:26,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:23:26,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:23:26,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:23:26,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:23:26,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:23:26,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:23:26,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 02:23:26,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:23:26,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:23:26,810 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 02:23:26,810 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_01ca8d01-d43b-4b27-a8a2-8adc08193844/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-10 02:23:26,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:23:26,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:23:26,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:23:26,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:23:26,848 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:23:26,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 02:23:26,892 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/data/8ad8e9ec5/9d7c463684224ba3b48d3635650182e5/FLAG4ead822a0 [2018-11-10 02:23:27,219 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:23:27,219 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 02:23:27,224 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/data/8ad8e9ec5/9d7c463684224ba3b48d3635650182e5/FLAG4ead822a0 [2018-11-10 02:23:27,232 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/data/8ad8e9ec5/9d7c463684224ba3b48d3635650182e5 [2018-11-10 02:23:27,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:23:27,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:23:27,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:23:27,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:23:27,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:23:27,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,240 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 02:23:27, skipping insertion in model container [2018-11-10 02:23:27,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:23:27,256 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:23:27,351 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:23:27,353 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:23:27,369 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:23:27,378 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:23:27,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27 WrapperNode [2018-11-10 02:23:27,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:23:27,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:23:27,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:23:27,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:23:27,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:23:27,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:23:27,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:23:27,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:23:27,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... [2018-11-10 02:23:27,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:23:27,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:23:27,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:23:27,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:23:27,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/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 02:23:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:23:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:23:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:23:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:23:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:23:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:23:27,667 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:23:27,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:23:27 BoogieIcfgContainer [2018-11-10 02:23:27,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:23:27,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:23:27,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:23:27,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:23:27,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:23:27" (1/3) ... [2018-11-10 02:23:27,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793a6d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:23:27, skipping insertion in model container [2018-11-10 02:23:27,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:27" (2/3) ... [2018-11-10 02:23:27,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793a6d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:23:27, skipping insertion in model container [2018-11-10 02:23:27,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:23:27" (3/3) ... [2018-11-10 02:23:27,674 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 02:23:27,682 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:23:27,688 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:23:27,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:23:27,731 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:23:27,732 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:23:27,732 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:23:27,732 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:23:27,732 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:23:27,732 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:23:27,732 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:23:27,732 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:23:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-10 02:23:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 02:23:27,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:27,753 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 02:23:27,755 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:27,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-11-10 02:23:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:27,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:27,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:27,887 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 02:23:27,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:27,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:27,889 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:27,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:27,901 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-10 02:23:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:27,934 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-11-10 02:23:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:27,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 02:23:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:27,942 INFO L225 Difference]: With dead ends: 77 [2018-11-10 02:23:27,942 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 02:23:27,944 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 02:23:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 02:23:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-10 02:23:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 02:23:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-11-10 02:23:27,969 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-11-10 02:23:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:27,969 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-11-10 02:23:27,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-11-10 02:23:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 02:23:27,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:27,970 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 02:23:27,970 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:27,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:27,970 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-11-10 02:23:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:27,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:27,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:27,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:27,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,005 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 02:23:28,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,005 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,007 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-11-10 02:23:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,031 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-11-10 02:23:28,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 02:23:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,032 INFO L225 Difference]: With dead ends: 100 [2018-11-10 02:23:28,032 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 02:23:28,033 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 02:23:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 02:23:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-10 02:23:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 02:23:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-11-10 02:23:28,037 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-11-10 02:23:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,037 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-11-10 02:23:28,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-11-10 02:23:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 02:23:28,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,038 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 02:23:28,038 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-11-10 02:23:28,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,069 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 02:23:28,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,070 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,070 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-11-10 02:23:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,092 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-11-10 02:23:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 02:23:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,093 INFO L225 Difference]: With dead ends: 94 [2018-11-10 02:23:28,093 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 02:23:28,094 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 02:23:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 02:23:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-10 02:23:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 02:23:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-11-10 02:23:28,097 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-11-10 02:23:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,098 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-11-10 02:23:28,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-10 02:23:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 02:23:28,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,098 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 02:23:28,098 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-11-10 02:23:28,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,128 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 02:23:28,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,129 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,130 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-11-10 02:23:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,146 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-11-10 02:23:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 02:23:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,147 INFO L225 Difference]: With dead ends: 117 [2018-11-10 02:23:28,147 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 02:23:28,148 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 02:23:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 02:23:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-11-10 02:23:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 02:23:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-11-10 02:23:28,153 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-11-10 02:23:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,154 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-11-10 02:23:28,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-11-10 02:23:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 02:23:28,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,154 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 02:23:28,155 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-11-10 02:23:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,174 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 02:23:28,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,175 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-11-10 02:23:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,189 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-11-10 02:23:28,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 02:23:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,190 INFO L225 Difference]: With dead ends: 191 [2018-11-10 02:23:28,190 INFO L226 Difference]: Without dead ends: 117 [2018-11-10 02:23:28,191 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 02:23:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-10 02:23:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-10 02:23:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 02:23:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-11-10 02:23:28,198 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-11-10 02:23:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,198 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-11-10 02:23:28,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-11-10 02:23:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 02:23:28,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,199 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 02:23:28,199 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-11-10 02:23:28,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,200 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,229 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 02:23:28,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,230 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,231 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-11-10 02:23:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,240 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-11-10 02:23:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 02:23:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,240 INFO L225 Difference]: With dead ends: 172 [2018-11-10 02:23:28,241 INFO L226 Difference]: Without dead ends: 119 [2018-11-10 02:23:28,241 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 02:23:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-10 02:23:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-10 02:23:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-10 02:23:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-11-10 02:23:28,248 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-11-10 02:23:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,248 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-11-10 02:23:28,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-11-10 02:23:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 02:23:28,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,249 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 02:23:28,249 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-11-10 02:23:28,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,278 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 02:23:28,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,279 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-11-10 02:23:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,298 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-11-10 02:23:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 02:23:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,299 INFO L225 Difference]: With dead ends: 213 [2018-11-10 02:23:28,300 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 02:23:28,300 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 02:23:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 02:23:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-11-10 02:23:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 02:23:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-11-10 02:23:28,309 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-11-10 02:23:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,309 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-11-10 02:23:28,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-11-10 02:23:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 02:23:28,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,310 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 02:23:28,310 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-11-10 02:23:28,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,329 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 02:23:28,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,330 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-11-10 02:23:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,360 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-11-10 02:23:28,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 02:23:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,362 INFO L225 Difference]: With dead ends: 365 [2018-11-10 02:23:28,362 INFO L226 Difference]: Without dead ends: 219 [2018-11-10 02:23:28,362 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 02:23:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-10 02:23:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-10 02:23:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 02:23:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-11-10 02:23:28,373 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-11-10 02:23:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,373 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-11-10 02:23:28,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-11-10 02:23:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 02:23:28,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,375 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 02:23:28,375 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-11-10 02:23:28,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,394 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 02:23:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,395 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-11-10 02:23:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,417 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-10 02:23:28,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 02:23:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,419 INFO L225 Difference]: With dead ends: 325 [2018-11-10 02:23:28,419 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 02:23:28,420 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 02:23:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 02:23:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-10 02:23:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 02:23:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-11-10 02:23:28,430 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-11-10 02:23:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,430 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-11-10 02:23:28,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-11-10 02:23:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 02:23:28,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,431 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 02:23:28,431 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-11-10 02:23:28,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,457 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 02:23:28,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,458 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,459 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-11-10 02:23:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,480 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-11-10 02:23:28,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 02:23:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,482 INFO L225 Difference]: With dead ends: 397 [2018-11-10 02:23:28,483 INFO L226 Difference]: Without dead ends: 395 [2018-11-10 02:23:28,483 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 02:23:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-10 02:23:28,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-11-10 02:23:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-10 02:23:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-11-10 02:23:28,493 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-11-10 02:23:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,494 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-11-10 02:23:28,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-11-10 02:23:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 02:23:28,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,495 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 02:23:28,495 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-11-10 02:23:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,516 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 02:23:28,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,517 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,517 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-11-10 02:23:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,537 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-11-10 02:23:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 02:23:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,540 INFO L225 Difference]: With dead ends: 709 [2018-11-10 02:23:28,540 INFO L226 Difference]: Without dead ends: 419 [2018-11-10 02:23:28,541 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 02:23:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-10 02:23:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-11-10 02:23:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-10 02:23:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-11-10 02:23:28,552 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-11-10 02:23:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,552 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-11-10 02:23:28,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-11-10 02:23:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 02:23:28,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,553 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, 1] [2018-11-10 02:23:28,553 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-11-10 02:23:28,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,578 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 02:23:28,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,579 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-11-10 02:23:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,616 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-11-10 02:23:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 02:23:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,618 INFO L225 Difference]: With dead ends: 625 [2018-11-10 02:23:28,619 INFO L226 Difference]: Without dead ends: 427 [2018-11-10 02:23:28,619 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 02:23:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-10 02:23:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-11-10 02:23:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-10 02:23:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-11-10 02:23:28,632 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-11-10 02:23:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,633 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-11-10 02:23:28,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-11-10 02:23:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 02:23:28,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,634 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, 1] [2018-11-10 02:23:28,634 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-11-10 02:23:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,650 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 02:23:28,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,651 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-11-10 02:23:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,681 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-11-10 02:23:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 02:23:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,684 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 02:23:28,684 INFO L226 Difference]: Without dead ends: 811 [2018-11-10 02:23:28,685 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 02:23:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-10 02:23:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-11-10 02:23:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-10 02:23:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-11-10 02:23:28,709 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-11-10 02:23:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,709 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-11-10 02:23:28,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-11-10 02:23:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 02:23:28,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,711 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, 1] [2018-11-10 02:23:28,711 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-11-10 02:23:28,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,727 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 02:23:28,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,728 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,729 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-11-10 02:23:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,752 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-11-10 02:23:28,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 02:23:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,755 INFO L225 Difference]: With dead ends: 957 [2018-11-10 02:23:28,755 INFO L226 Difference]: Without dead ends: 955 [2018-11-10 02:23:28,755 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 02:23:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-10 02:23:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-11-10 02:23:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-10 02:23:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-11-10 02:23:28,780 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-11-10 02:23:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,780 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-11-10 02:23:28,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-11-10 02:23:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 02:23:28,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,782 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, 1, 1] [2018-11-10 02:23:28,782 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,782 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-11-10 02:23:28,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,797 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 02:23:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,797 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,798 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-11-10 02:23:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,841 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-11-10 02:23:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 02:23:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,845 INFO L225 Difference]: With dead ends: 1405 [2018-11-10 02:23:28,845 INFO L226 Difference]: Without dead ends: 1403 [2018-11-10 02:23:28,846 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 02:23:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-11-10 02:23:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-11-10 02:23:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 02:23:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-11-10 02:23:28,881 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-11-10 02:23:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:28,881 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-11-10 02:23:28,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-11-10 02:23:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 02:23:28,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:28,883 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, 1, 1] [2018-11-10 02:23:28,883 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:28,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-11-10 02:23:28,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:28,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:28,896 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 02:23:28,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:28,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:28,897 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:28,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:28,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:28,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:28,897 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-11-10 02:23:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,948 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-11-10 02:23:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:28,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 02:23:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:28,952 INFO L225 Difference]: With dead ends: 2717 [2018-11-10 02:23:28,952 INFO L226 Difference]: Without dead ends: 1563 [2018-11-10 02:23:28,954 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 02:23:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-11-10 02:23:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-11-10 02:23:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-10 02:23:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-11-10 02:23:29,004 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-11-10 02:23:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:29,004 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-11-10 02:23:29,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-11-10 02:23:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 02:23:29,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:29,006 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, 1, 1, 1] [2018-11-10 02:23:29,006 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:29,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-11-10 02:23:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:29,025 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 02:23:29,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:29,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:29,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:29,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:29,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:29,026 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-11-10 02:23:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:29,073 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-11-10 02:23:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:29,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 02:23:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:29,078 INFO L225 Difference]: With dead ends: 2365 [2018-11-10 02:23:29,078 INFO L226 Difference]: Without dead ends: 1611 [2018-11-10 02:23:29,079 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 02:23:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-10 02:23:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-11-10 02:23:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-10 02:23:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-11-10 02:23:29,129 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-11-10 02:23:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:29,129 INFO L481 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-11-10 02:23:29,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-11-10 02:23:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 02:23:29,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:29,131 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, 1, 1, 1] [2018-11-10 02:23:29,131 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:29,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:29,131 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-11-10 02:23:29,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:29,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:29,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:29,145 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 02:23:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:29,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:29,145 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:29,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:29,146 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-11-10 02:23:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:29,205 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-11-10 02:23:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:29,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 02:23:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:29,212 INFO L225 Difference]: With dead ends: 2701 [2018-11-10 02:23:29,212 INFO L226 Difference]: Without dead ends: 2699 [2018-11-10 02:23:29,213 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 02:23:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-11-10 02:23:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-11-10 02:23:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-10 02:23:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-11-10 02:23:29,285 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-11-10 02:23:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:29,285 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-11-10 02:23:29,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-11-10 02:23:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 02:23:29,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:29,289 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, 1, 1, 1] [2018-11-10 02:23:29,289 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:29,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-11-10 02:23:29,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:29,302 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 02:23:29,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:29,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:29,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:29,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:29,303 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-11-10 02:23:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:29,403 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-11-10 02:23:29,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:29,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 02:23:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:29,412 INFO L225 Difference]: With dead ends: 5389 [2018-11-10 02:23:29,412 INFO L226 Difference]: Without dead ends: 3083 [2018-11-10 02:23:29,415 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 02:23:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-10 02:23:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-11-10 02:23:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-11-10 02:23:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-11-10 02:23:29,504 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-11-10 02:23:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:29,504 INFO L481 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-11-10 02:23:29,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-11-10 02:23:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 02:23:29,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:29,507 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, 1, 1, 1, 1] [2018-11-10 02:23:29,507 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:29,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-11-10 02:23:29,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:29,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:29,537 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 02:23:29,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:29,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:29,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:29,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:29,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:29,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:29,538 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-11-10 02:23:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:29,608 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-11-10 02:23:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:29,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 02:23:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:29,615 INFO L225 Difference]: With dead ends: 4621 [2018-11-10 02:23:29,616 INFO L226 Difference]: Without dead ends: 3147 [2018-11-10 02:23:29,618 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 02:23:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-11-10 02:23:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-11-10 02:23:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-10 02:23:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-11-10 02:23:29,707 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-11-10 02:23:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:29,707 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-11-10 02:23:29,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-11-10 02:23:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 02:23:29,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:29,710 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, 1, 1, 1, 1] [2018-11-10 02:23:29,710 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:29,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-11-10 02:23:29,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:29,733 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 02:23:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:29,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:29,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:29,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:29,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:29,734 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-11-10 02:23:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:29,824 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-11-10 02:23:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:29,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 02:23:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:29,836 INFO L225 Difference]: With dead ends: 5131 [2018-11-10 02:23:29,836 INFO L226 Difference]: Without dead ends: 5129 [2018-11-10 02:23:29,838 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 02:23:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-11-10 02:23:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-11-10 02:23:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-11-10 02:23:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-11-10 02:23:29,946 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-11-10 02:23:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:29,947 INFO L481 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-11-10 02:23:29,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-11-10 02:23:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 02:23:29,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:29,952 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, 1, 1, 1, 1] [2018-11-10 02:23:29,952 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:29,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-11-10 02:23:29,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:29,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:29,964 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 02:23:29,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:29,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:29,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:29,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:29,966 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-11-10 02:23:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:30,075 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-11-10 02:23:30,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:30,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 02:23:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:30,076 INFO L225 Difference]: With dead ends: 10633 [2018-11-10 02:23:30,076 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 02:23:30,086 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 02:23:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 02:23:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 02:23:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 02:23:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 02:23:30,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-10 02:23:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:30,087 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:23:30,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:23:30,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 02:23:30,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 02:23:30,131 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 02:23:30,131 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:23:30,131 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:23:30,131 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 02:23:30,131 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 02:23:30,131 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 02:23:30,131 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-10 02:23:30,131 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,132 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-10 02:23:30,133 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-10 02:23:30,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:23:30 BoogieIcfgContainer [2018-11-10 02:23:30,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:23:30,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:23:30,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:23:30,143 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:23:30,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:23:27" (3/4) ... [2018-11-10 02:23:30,146 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 02:23:30,151 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 02:23:30,151 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 02:23:30,155 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 02:23:30,155 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 02:23:30,156 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 02:23:30,198 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_01ca8d01-d43b-4b27-a8a2-8adc08193844/bin-2019/utaipan/witness.graphml [2018-11-10 02:23:30,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:23:30,200 INFO L168 Benchmark]: Toolchain (without parser) took 2965.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 953.8 MB in the beginning and 936.4 MB in the end (delta: 17.3 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:30,201 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:23:30,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.13 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:30,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.27 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:30,202 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:23:30,202 INFO L168 Benchmark]: RCFGBuilder took 252.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:30,202 INFO L168 Benchmark]: TraceAbstraction took 2474.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 936.4 MB in the end (delta: 171.7 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:30,202 INFO L168 Benchmark]: Witness Printer took 56.20 ms. Allocated memory is still 1.2 GB. Free memory is still 936.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:23:30,204 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.13 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 16.27 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.01 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 252.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2474.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 936.4 MB in the end (delta: 171.7 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.20 ms. Allocated memory is still 1.2 GB. Free memory is still 936.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, 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.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...