./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:32:59,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:32:59,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:32:59,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:32:59,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:32:59,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:32:59,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:32:59,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:32:59,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:32:59,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:32:59,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:32:59,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:32:59,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:32:59,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:32:59,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:32:59,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:32:59,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:32:59,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:32:59,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:32:59,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:32:59,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:32:59,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:32:59,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:32:59,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:32:59,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:32:59,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:32:59,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:32:59,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:32:59,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:32:59,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:32:59,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:32:59,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:32:59,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:32:59,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:32:59,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:32:59,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:32:59,542 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:32:59,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:32:59,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:32:59,552 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:32:59,553 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:32:59,553 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:32:59,553 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:32:59,553 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:32:59,553 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:32:59,553 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:32:59,553 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:32:59,554 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:32:59,554 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:32:59,554 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:32:59,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:32:59,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:32:59,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:32:59,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:32:59,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:32:59,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:32:59,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:32:59,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:32:59,557 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:32:59,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:32:59,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:32:59,557 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:32:59,557 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_4a44831e-3c24-4b9f-bcde-0c189dde3590/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2018-11-18 14:32:59,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:32:59,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:32:59,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:32:59,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:32:59,593 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:32:59,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:32:59,640 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/data/9169b9cc9/af5070ef2ae545598fe64d7796727927/FLAG295612fc6 [2018-11-18 14:32:59,957 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:32:59,957 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:32:59,962 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/data/9169b9cc9/af5070ef2ae545598fe64d7796727927/FLAG295612fc6 [2018-11-18 14:33:00,396 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/data/9169b9cc9/af5070ef2ae545598fe64d7796727927 [2018-11-18 14:33:00,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:33:00,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:33:00,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:33:00,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:33:00,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:33:00,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d293ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00, skipping insertion in model container [2018-11-18 14:33:00,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:33:00,423 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:33:00,524 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:33:00,526 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:33:00,539 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:33:00,549 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:33:00,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00 WrapperNode [2018-11-18 14:33:00,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:33:00,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:33:00,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:33:00,550 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:33:00,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:33:00,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:33:00,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:33:00,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:33:00,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... [2018-11-18 14:33:00,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:33:00,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:33:00,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:33:00,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:33:00,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/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-18 14:33:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:33:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:33:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:33:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:33:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:33:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:33:00,790 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:33:00,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:00 BoogieIcfgContainer [2018-11-18 14:33:00,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:33:00,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:33:00,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:33:00,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:33:00,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:33:00" (1/3) ... [2018-11-18 14:33:00,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535f2e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:00, skipping insertion in model container [2018-11-18 14:33:00,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:00" (2/3) ... [2018-11-18 14:33:00,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535f2e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:00, skipping insertion in model container [2018-11-18 14:33:00,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:00" (3/3) ... [2018-11-18 14:33:00,796 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 14:33:00,802 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:33:00,807 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:33:00,816 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:33:00,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:33:00,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:33:00,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:33:00,841 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:33:00,841 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:33:00,841 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:33:00,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:33:00,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:33:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 14:33:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 14:33:00,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:00,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:00,864 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:00,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash -6959071, now seen corresponding path program 1 times [2018-11-18 14:33:00,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:00,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:00,980 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-18 14:33:00,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:00,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:00,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:00,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:00,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:00,994 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-18 14:33:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,034 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2018-11-18 14:33:01,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 14:33:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,045 INFO L225 Difference]: With dead ends: 59 [2018-11-18 14:33:01,045 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 14:33:01,047 INFO L604 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-18 14:33:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 14:33:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-18 14:33:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 14:33:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2018-11-18 14:33:01,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2018-11-18 14:33:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,071 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2018-11-18 14:33:01,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 14:33:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 14:33:01,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,071 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash -816305697, now seen corresponding path program 1 times [2018-11-18 14:33:01,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,094 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-18 14:33:01,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,096 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 3 states. [2018-11-18 14:33:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,119 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2018-11-18 14:33:01,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 14:33:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,120 INFO L225 Difference]: With dead ends: 70 [2018-11-18 14:33:01,120 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 14:33:01,121 INFO L604 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-18 14:33:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 14:33:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 14:33:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 14:33:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2018-11-18 14:33:01,125 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 16 [2018-11-18 14:33:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,125 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2018-11-18 14:33:01,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2018-11-18 14:33:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 14:33:01,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash -215516200, now seen corresponding path program 1 times [2018-11-18 14:33:01,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,148 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-18 14:33:01,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,149 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 3 states. [2018-11-18 14:33:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,168 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2018-11-18 14:33:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 14:33:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,169 INFO L225 Difference]: With dead ends: 67 [2018-11-18 14:33:01,169 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 14:33:01,170 INFO L604 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-18 14:33:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 14:33:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 14:33:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 14:33:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2018-11-18 14:33:01,174 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 17 [2018-11-18 14:33:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,174 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2018-11-18 14:33:01,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2018-11-18 14:33:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 14:33:01,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,175 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 464542170, now seen corresponding path program 1 times [2018-11-18 14:33:01,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,199 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-18 14:33:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,201 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand 3 states. [2018-11-18 14:33:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,222 INFO L93 Difference]: Finished difference Result 81 states and 125 transitions. [2018-11-18 14:33:01,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 14:33:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,224 INFO L225 Difference]: With dead ends: 81 [2018-11-18 14:33:01,224 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 14:33:01,224 INFO L604 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-18 14:33:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 14:33:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-11-18 14:33:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 14:33:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2018-11-18 14:33:01,230 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 17 [2018-11-18 14:33:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,231 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2018-11-18 14:33:01,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2018-11-18 14:33:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 14:33:01,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,231 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash -344804456, now seen corresponding path program 1 times [2018-11-18 14:33:01,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,252 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-18 14:33:01,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,255 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand 3 states. [2018-11-18 14:33:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,272 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2018-11-18 14:33:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 14:33:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,273 INFO L225 Difference]: With dead ends: 131 [2018-11-18 14:33:01,273 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 14:33:01,273 INFO L604 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-18 14:33:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 14:33:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-18 14:33:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 14:33:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2018-11-18 14:33:01,280 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 17 [2018-11-18 14:33:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,280 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2018-11-18 14:33:01,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2018-11-18 14:33:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:33:01,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,281 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1516120724, now seen corresponding path program 1 times [2018-11-18 14:33:01,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,296 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-18 14:33:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,297 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand 3 states. [2018-11-18 14:33:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,320 INFO L93 Difference]: Finished difference Result 118 states and 176 transitions. [2018-11-18 14:33:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:33:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,321 INFO L225 Difference]: With dead ends: 118 [2018-11-18 14:33:01,322 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 14:33:01,322 INFO L604 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-18 14:33:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 14:33:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-18 14:33:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 14:33:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2018-11-18 14:33:01,328 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 18 [2018-11-18 14:33:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,328 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2018-11-18 14:33:01,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2018-11-18 14:33:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:33:01,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,329 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2098788202, now seen corresponding path program 1 times [2018-11-18 14:33:01,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,343 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-18 14:33:01,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,344 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand 3 states. [2018-11-18 14:33:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,353 INFO L93 Difference]: Finished difference Result 141 states and 209 transitions. [2018-11-18 14:33:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:33:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,354 INFO L225 Difference]: With dead ends: 141 [2018-11-18 14:33:01,354 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 14:33:01,354 INFO L604 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-18 14:33:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 14:33:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-18 14:33:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 14:33:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2018-11-18 14:33:01,360 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 18 [2018-11-18 14:33:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,361 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2018-11-18 14:33:01,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-11-18 14:33:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 14:33:01,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,362 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:33:01,362 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1386832468, now seen corresponding path program 1 times [2018-11-18 14:33:01,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,383 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-18 14:33:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,384 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2018-11-18 14:33:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,399 INFO L93 Difference]: Finished difference Result 245 states and 357 transitions. [2018-11-18 14:33:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 14:33:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,400 INFO L225 Difference]: With dead ends: 245 [2018-11-18 14:33:01,400 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 14:33:01,401 INFO L604 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-18 14:33:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 14:33:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-18 14:33:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 14:33:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-18 14:33:01,407 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 18 [2018-11-18 14:33:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,407 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-18 14:33:01,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-18 14:33:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:33:01,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,408 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-18 14:33:01,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash -637709139, now seen corresponding path program 1 times [2018-11-18 14:33:01,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,428 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-18 14:33:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,429 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 3 states. [2018-11-18 14:33:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,447 INFO L93 Difference]: Finished difference Result 217 states and 301 transitions. [2018-11-18 14:33:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:33:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,448 INFO L225 Difference]: With dead ends: 217 [2018-11-18 14:33:01,448 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 14:33:01,449 INFO L604 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-18 14:33:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 14:33:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-18 14:33:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 14:33:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2018-11-18 14:33:01,456 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 19 [2018-11-18 14:33:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,456 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2018-11-18 14:33:01,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-11-18 14:33:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:33:01,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,457 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-18 14:33:01,457 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,457 INFO L82 PathProgramCache]: Analyzing trace with hash 42349231, now seen corresponding path program 1 times [2018-11-18 14:33:01,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,476 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-18 14:33:01,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,477 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 3 states. [2018-11-18 14:33:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,500 INFO L93 Difference]: Finished difference Result 253 states and 345 transitions. [2018-11-18 14:33:01,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:33:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,502 INFO L225 Difference]: With dead ends: 253 [2018-11-18 14:33:01,502 INFO L226 Difference]: Without dead ends: 251 [2018-11-18 14:33:01,503 INFO L604 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-18 14:33:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-18 14:33:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 209. [2018-11-18 14:33:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-18 14:33:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2018-11-18 14:33:01,512 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 279 transitions. Word has length 19 [2018-11-18 14:33:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,513 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 279 transitions. [2018-11-18 14:33:01,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 279 transitions. [2018-11-18 14:33:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:33:01,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,514 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-18 14:33:01,514 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash -766997395, now seen corresponding path program 1 times [2018-11-18 14:33:01,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,536 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-18 14:33:01,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,537 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand 3 states. [2018-11-18 14:33:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,561 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2018-11-18 14:33:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 14:33:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,562 INFO L225 Difference]: With dead ends: 469 [2018-11-18 14:33:01,562 INFO L226 Difference]: Without dead ends: 275 [2018-11-18 14:33:01,563 INFO L604 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-18 14:33:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-18 14:33:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-11-18 14:33:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 14:33:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2018-11-18 14:33:01,573 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 19 [2018-11-18 14:33:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,574 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2018-11-18 14:33:01,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2018-11-18 14:33:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:33:01,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,575 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-18 14:33:01,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1313042185, now seen corresponding path program 1 times [2018-11-18 14:33:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,593 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-18 14:33:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,594 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand 3 states. [2018-11-18 14:33:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,614 INFO L93 Difference]: Finished difference Result 409 states and 509 transitions. [2018-11-18 14:33:01,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:33:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,616 INFO L225 Difference]: With dead ends: 409 [2018-11-18 14:33:01,616 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 14:33:01,617 INFO L604 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-18 14:33:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 14:33:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-11-18 14:33:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 14:33:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 343 transitions. [2018-11-18 14:33:01,626 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 343 transitions. Word has length 20 [2018-11-18 14:33:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,626 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 343 transitions. [2018-11-18 14:33:01,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 343 transitions. [2018-11-18 14:33:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:33:01,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,627 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-18 14:33:01,627 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1993100555, now seen corresponding path program 1 times [2018-11-18 14:33:01,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,640 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-18 14:33:01,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,641 INFO L87 Difference]: Start difference. First operand 281 states and 343 transitions. Second operand 3 states. [2018-11-18 14:33:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,664 INFO L93 Difference]: Finished difference Result 779 states and 920 transitions. [2018-11-18 14:33:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:33:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,666 INFO L225 Difference]: With dead ends: 779 [2018-11-18 14:33:01,666 INFO L226 Difference]: Without dead ends: 281 [2018-11-18 14:33:01,667 INFO L604 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-18 14:33:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-18 14:33:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-18 14:33:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 14:33:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 311 transitions. [2018-11-18 14:33:01,677 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 311 transitions. Word has length 20 [2018-11-18 14:33:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,677 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 311 transitions. [2018-11-18 14:33:01,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-18 14:33:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:33:01,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:33:01,678 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-18 14:33:01,678 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:33:01,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:33:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1492520115, now seen corresponding path program 1 times [2018-11-18 14:33:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:33:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:33:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:33:01,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:33:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:33:01,701 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-18 14:33:01,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:33:01,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:33:01,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:33:01,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:33:01,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:33:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:33:01,703 INFO L87 Difference]: Start difference. First operand 281 states and 311 transitions. Second operand 3 states. [2018-11-18 14:33:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:33:01,713 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-18 14:33:01,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:33:01,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:33:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:33:01,714 INFO L225 Difference]: With dead ends: 281 [2018-11-18 14:33:01,714 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:33:01,715 INFO L604 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-18 14:33:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:33:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:33:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:33:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:33:01,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-18 14:33:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:33:01,716 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:33:01,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:33:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:33:01,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:33:01,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:33:01,732 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 14:33:01,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:33:01,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:33:01,732 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 14:33:01,732 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:33:01,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L428 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L428 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,733 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-18 14:33:01,733 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-18 14:33:01,734 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-18 14:33:01,734 INFO L421 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-18 14:33:01,734 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 14:33:01,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:33:01 BoogieIcfgContainer [2018-11-18 14:33:01,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:33:01,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:33:01,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:33:01,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:33:01,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:00" (3/4) ... [2018-11-18 14:33:01,741 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:33:01,744 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:33:01,745 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:33:01,747 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 14:33:01,747 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 14:33:01,748 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 14:33:01,781 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a44831e-3c24-4b9f-bcde-0c189dde3590/bin-2019/utaipan/witness.graphml [2018-11-18 14:33:01,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:33:01,782 INFO L168 Benchmark]: Toolchain (without parser) took 1383.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 953.8 MB in the beginning and 963.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:33:01,783 INFO L168 Benchmark]: CDTParser took 0.17 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-18 14:33:01,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.21 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-18 14:33:01,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.85 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-18 14:33:01,784 INFO L168 Benchmark]: Boogie Preprocessor took 18.69 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-18 14:33:01,784 INFO L168 Benchmark]: RCFGBuilder took 205.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:33:01,784 INFO L168 Benchmark]: TraceAbstraction took 946.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 967.0 MB in the end (delta: 124.2 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:33:01,785 INFO L168 Benchmark]: Witness Printer took 43.21 ms. Allocated memory is still 1.1 GB. Free memory was 967.0 MB in the beginning and 963.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:33:01,786 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.17 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 150.21 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.85 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 18.69 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 205.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 946.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 967.0 MB in the end (delta: 124.2 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. * Witness Printer took 43.21 ms. Allocated memory is still 1.1 GB. Free memory was 967.0 MB in the beginning and 963.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: 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, 30 locations, 1 error locations. SAFE Result, 0.9s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 297 SDslu, 428 SDs, 0 SdLazy, 73 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=12, 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 121 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 7060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...