./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:33:25,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:33:25,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:33:25,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:33:25,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:33:25,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:33:25,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:33:25,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:33:25,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:33:25,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:33:25,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:33:25,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:33:25,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:33:25,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:33:25,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:33:25,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:33:25,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:33:25,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:33:25,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:33:25,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:33:25,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:33:25,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:33:25,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:33:25,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:33:25,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:33:25,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:33:25,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:33:25,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:33:25,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:33:25,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:33:25,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:33:25,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:33:25,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:33:25,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:33:25,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:33:25,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:33:25,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:33:25,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:33:25,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:33:25,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:33:25,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:33:25,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2019-12-07 11:33:25,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:33:25,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:33:25,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:33:25,664 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:33:25,664 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:33:25,665 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:33:25,665 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:33:25,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:33:25,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:33:25,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:33:25,666 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:33:25,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:33:25,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:33:25,666 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:33:25,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:33:25,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:33:25,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:33:25,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:33:25,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:33:25,668 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:33:25,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:33:25,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:33:25,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:33:25,668 INFO L138 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/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-12-07 11:33:25,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:33:25,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:33:25,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:33:25,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:33:25,782 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:33:25,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-12-07 11:33:25,828 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/data/b5bdcf3e0/338a09fcf69c4263af36cb052fc90953/FLAG9910c8110 [2019-12-07 11:33:26,149 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:33:26,149 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-12-07 11:33:26,153 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/data/b5bdcf3e0/338a09fcf69c4263af36cb052fc90953/FLAG9910c8110 [2019-12-07 11:33:26,162 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/data/b5bdcf3e0/338a09fcf69c4263af36cb052fc90953 [2019-12-07 11:33:26,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:33:26,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:33:26,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:33:26,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:33:26,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:33:26,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce49fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26, skipping insertion in model container [2019-12-07 11:33:26,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:33:26,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:33:26,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:33:26,340 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:33:26,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:33:26,361 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:33:26,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26 WrapperNode [2019-12-07 11:33:26,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:33:26,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:33:26,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:33:26,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:33:26,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:33:26,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:33:26,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:33:26,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:33:26,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... [2019-12-07 11:33:26,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:33:26,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:33:26,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:33:26,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:33:26,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/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 [2019-12-07 11:33:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:33:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:33:26,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:33:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:33:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:33:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:33:26,655 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:33:26,655 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 11:33:26,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:26 BoogieIcfgContainer [2019-12-07 11:33:26,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:33:26,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:33:26,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:33:26,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:33:26,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:33:26" (1/3) ... [2019-12-07 11:33:26,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b269ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:33:26, skipping insertion in model container [2019-12-07 11:33:26,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:26" (2/3) ... [2019-12-07 11:33:26,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b269ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:33:26, skipping insertion in model container [2019-12-07 11:33:26,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:26" (3/3) ... [2019-12-07 11:33:26,662 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-12-07 11:33:26,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:33:26,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-12-07 11:33:26,681 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-12-07 11:33:26,693 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:33:26,693 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:33:26,693 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:33:26,693 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:33:26,693 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:33:26,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:33:26,694 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:33:26,694 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:33:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-12-07 11:33:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:33:26,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:26,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:33:26,709 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:26,713 INFO L82 PathProgramCache]: Analyzing trace with hash 3476, now seen corresponding path program 1 times [2019-12-07 11:33:26,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:26,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371608837] [2019-12-07 11:33:26,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:26,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371608837] [2019-12-07 11:33:26,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:26,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:26,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616265339] [2019-12-07 11:33:26,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:26,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:26,850 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-12-07 11:33:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:26,911 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-12-07 11:33:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:26,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:33:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:26,919 INFO L225 Difference]: With dead ends: 50 [2019-12-07 11:33:26,919 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 11:33:26,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 11:33:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 11:33:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 11:33:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 11:33:26,944 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 2 [2019-12-07 11:33:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:26,944 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 11:33:26,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 11:33:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:33:26,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:26,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:33:26,945 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 3477, now seen corresponding path program 1 times [2019-12-07 11:33:26,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:26,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636451197] [2019-12-07 11:33:26,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:26,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636451197] [2019-12-07 11:33:26,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:26,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:26,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672613780] [2019-12-07 11:33:26,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:26,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:26,986 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2019-12-07 11:33:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,022 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-12-07 11:33:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:33:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,023 INFO L225 Difference]: With dead ends: 45 [2019-12-07 11:33:27,023 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 11:33:27,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 11:33:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 11:33:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:33:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-12-07 11:33:27,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 2 [2019-12-07 11:33:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,028 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-12-07 11:33:27,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-12-07 11:33:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:33:27,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:33:27,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 107732, now seen corresponding path program 1 times [2019-12-07 11:33:27,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166828694] [2019-12-07 11:33:27,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166828694] [2019-12-07 11:33:27,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:27,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861909491] [2019-12-07 11:33:27,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:27,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,053 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2019-12-07 11:33:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,086 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-12-07 11:33:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:33:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,087 INFO L225 Difference]: With dead ends: 41 [2019-12-07 11:33:27,087 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:33:27,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:33:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 11:33:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:33:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 11:33:27,090 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 3 [2019-12-07 11:33:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,091 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 11:33:27,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 11:33:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:33:27,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:33:27,091 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash 107733, now seen corresponding path program 1 times [2019-12-07 11:33:27,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723820433] [2019-12-07 11:33:27,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723820433] [2019-12-07 11:33:27,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:27,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213781055] [2019-12-07 11:33:27,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:27,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,122 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2019-12-07 11:33:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,145 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-12-07 11:33:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:33:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,146 INFO L225 Difference]: With dead ends: 37 [2019-12-07 11:33:27,146 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 11:33:27,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 11:33:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 11:33:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 11:33:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-12-07 11:33:27,149 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 3 [2019-12-07 11:33:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,149 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-12-07 11:33:27,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-12-07 11:33:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:33:27,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:33:27,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash 3339671, now seen corresponding path program 1 times [2019-12-07 11:33:27,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401645008] [2019-12-07 11:33:27,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401645008] [2019-12-07 11:33:27,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:27,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345976345] [2019-12-07 11:33:27,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:27,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:27,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,172 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 3 states. [2019-12-07 11:33:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,200 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-12-07 11:33:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:33:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,201 INFO L225 Difference]: With dead ends: 33 [2019-12-07 11:33:27,201 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 11:33:27,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 11:33:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 11:33:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:33:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-12-07 11:33:27,204 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2019-12-07 11:33:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,204 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-12-07 11:33:27,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-12-07 11:33:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:33:27,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:33:27,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash 3339672, now seen corresponding path program 1 times [2019-12-07 11:33:27,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207872262] [2019-12-07 11:33:27,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207872262] [2019-12-07 11:33:27,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:27,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948566458] [2019-12-07 11:33:27,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:27,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,229 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2019-12-07 11:33:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,249 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-12-07 11:33:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:33:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,250 INFO L225 Difference]: With dead ends: 29 [2019-12-07 11:33:27,250 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:33:27,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:33:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 11:33:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 11:33:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-12-07 11:33:27,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 4 [2019-12-07 11:33:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,253 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-12-07 11:33:27,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-12-07 11:33:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:33:27,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:33:27,253 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash 103529783, now seen corresponding path program 1 times [2019-12-07 11:33:27,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529771420] [2019-12-07 11:33:27,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529771420] [2019-12-07 11:33:27,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:27,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213203371] [2019-12-07 11:33:27,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:27,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,270 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2019-12-07 11:33:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,293 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-12-07 11:33:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:33:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,293 INFO L225 Difference]: With dead ends: 26 [2019-12-07 11:33:27,293 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 11:33:27,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 11:33:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 11:33:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:33:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 11:33:27,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2019-12-07 11:33:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,296 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 11:33:27,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 11:33:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:33:27,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:33:27,297 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 103529784, now seen corresponding path program 1 times [2019-12-07 11:33:27,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707626154] [2019-12-07 11:33:27,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707626154] [2019-12-07 11:33:27,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:27,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987871058] [2019-12-07 11:33:27,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,319 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2019-12-07 11:33:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,337 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-12-07 11:33:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:27,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:33:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,338 INFO L225 Difference]: With dead ends: 23 [2019-12-07 11:33:27,338 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 11:33:27,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 11:33:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 11:33:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:33:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-12-07 11:33:27,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 5 [2019-12-07 11:33:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,340 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-12-07 11:33:27,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-12-07 11:33:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:33:27,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:27,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1661417693, now seen corresponding path program 1 times [2019-12-07 11:33:27,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834209708] [2019-12-07 11:33:27,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834209708] [2019-12-07 11:33:27,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:27,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:33:27,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359869144] [2019-12-07 11:33:27,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:27,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:27,360 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2019-12-07 11:33:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:27,409 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-12-07 11:33:27,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:27,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 11:33:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:27,410 INFO L225 Difference]: With dead ends: 38 [2019-12-07 11:33:27,410 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 11:33:27,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:33:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 11:33:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2019-12-07 11:33:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 11:33:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-12-07 11:33:27,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2019-12-07 11:33:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:27,413 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-12-07 11:33:27,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-12-07 11:33:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:33:27,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:27,413 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:27,413 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash -723063482, now seen corresponding path program 1 times [2019-12-07 11:33:27,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:27,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347005172] [2019-12-07 11:33:27,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347005172] [2019-12-07 11:33:27,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144656564] [2019-12-07 11:33:27,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:27,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:33:27,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:27,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:27,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-12-07 11:33:27,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:27,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:4 [2019-12-07 11:33:27,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:33:27,641 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:27,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 11:33:27,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:33:27,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 11:33:27,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:27,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:33:27,683 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-12-07 11:33:27,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 11:33:27,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:27,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,702 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 11:33:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,703 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:27,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:33:27,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:27,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:27,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:4 [2019-12-07 11:33:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:27,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316910818] [2019-12-07 11:33:27,756 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 11:33:27,756 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:27,760 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:27,764 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:27,764 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:28,214 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:28,389 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 11:33:28,575 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-12-07 11:33:28,752 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-07 11:33:28,956 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-07 11:33:29,717 WARN L192 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 88 [2019-12-07 11:33:30,499 WARN L192 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-12-07 11:33:31,345 WARN L192 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-12-07 11:33:31,796 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 85 [2019-12-07 11:33:31,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:31,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5, 5] total 14 [2019-12-07 11:33:31,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275813658] [2019-12-07 11:33:31,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:33:31,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:33:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:33:31,798 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2019-12-07 11:33:32,132 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 11:33:32,425 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 11:33:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:32,678 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-12-07 11:33:32,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:33:32,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-07 11:33:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:32,679 INFO L225 Difference]: With dead ends: 75 [2019-12-07 11:33:32,679 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 11:33:32,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:33:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 11:33:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 32. [2019-12-07 11:33:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 11:33:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-12-07 11:33:32,682 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2019-12-07 11:33:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:32,683 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-12-07 11:33:32,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:33:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-12-07 11:33:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:33:32,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:32,683 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:32,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:32,884 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:32,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1385146651, now seen corresponding path program 1 times [2019-12-07 11:33:32,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:32,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812211281] [2019-12-07 11:33:32,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:33,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812211281] [2019-12-07 11:33:33,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091317801] [2019-12-07 11:33:33,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:33,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 11:33:33,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:33,766 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:34,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545350775] [2019-12-07 11:33:34,050 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 11:33:34,050 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:34,050 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:34,050 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:34,050 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:35,098 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:35,325 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 11:33:35,549 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-12-07 11:33:35,788 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-07 11:33:36,053 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-07 11:33:36,606 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 11:33:36,782 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 11:33:36,968 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 11:33:37,158 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 11:33:37,447 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 77 [2019-12-07 11:33:37,825 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 89 [2019-12-07 11:33:37,895 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:33:37,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:37,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2019-12-07 11:33:37,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352930990] [2019-12-07 11:33:37,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 11:33:37,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 11:33:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1669, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:33:37,897 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 30 states. [2019-12-07 11:33:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:39,487 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-12-07 11:33:39,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:33:39,488 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 22 [2019-12-07 11:33:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:39,489 INFO L225 Difference]: With dead ends: 63 [2019-12-07 11:33:39,490 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 11:33:39,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=739, Invalid=3043, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 11:33:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 11:33:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2019-12-07 11:33:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 11:33:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-12-07 11:33:39,499 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2019-12-07 11:33:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:39,500 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-12-07 11:33:39,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 11:33:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-12-07 11:33:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:33:39,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:39,501 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:39,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:39,702 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1435305227, now seen corresponding path program 1 times [2019-12-07 11:33:39,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:39,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110635047] [2019-12-07 11:33:39,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:40,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110635047] [2019-12-07 11:33:40,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204344986] [2019-12-07 11:33:40,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:40,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 11:33:40,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:40,402 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:40,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1599431704] [2019-12-07 11:33:40,837 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-12-07 11:33:40,837 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:40,838 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:40,838 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:40,838 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:41,355 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:41,528 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 11:33:41,711 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-12-07 11:33:41,911 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-07 11:33:42,145 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-07 11:33:42,922 WARN L192 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 88 [2019-12-07 11:33:43,756 WARN L192 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-12-07 11:33:44,698 WARN L192 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 90 [2019-12-07 11:33:45,157 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 85 [2019-12-07 11:33:45,592 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 89 [2019-12-07 11:33:46,026 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 91 [2019-12-07 11:33:46,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:46,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7, 11, 11] total 36 [2019-12-07 11:33:46,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024392814] [2019-12-07 11:33:46,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:46,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:46,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:46,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:33:46,028 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 12 states. [2019-12-07 11:33:46,370 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 11:33:46,761 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 11:33:47,332 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-12-07 11:33:47,658 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-12-07 11:33:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:47,863 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2019-12-07 11:33:47,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:33:47,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-07 11:33:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:47,864 INFO L225 Difference]: With dead ends: 83 [2019-12-07 11:33:47,864 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 11:33:47,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=454, Invalid=1186, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:33:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 11:33:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2019-12-07 11:33:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 11:33:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 11:33:47,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 25 [2019-12-07 11:33:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:47,867 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 11:33:47,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:33:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 11:33:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:33:47,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:47,868 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:48,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:48,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1769996822, now seen corresponding path program 1 times [2019-12-07 11:33:48,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749560776] [2019-12-07 11:33:48,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749560776] [2019-12-07 11:33:48,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66174130] [2019-12-07 11:33:48,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 11:33:48,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,862 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:33:49,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537201666] [2019-12-07 11:33:49,726 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-12-07 11:33:49,726 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:49,726 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:49,726 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:49,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:53,024 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:53,245 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 11:33:53,444 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-12-07 11:33:53,664 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-07 11:33:54,001 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-07 11:33:54,651 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 11:33:55,029 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 11:33:55,377 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-07 11:33:56,328 WARN L192 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 87 [2019-12-07 11:33:56,521 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 11:33:56,727 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 11:33:57,126 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 78 [2019-12-07 11:33:57,609 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 89 [2019-12-07 11:33:57,823 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:33:57,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:57,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 14] total 32 [2019-12-07 11:33:57,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657024192] [2019-12-07 11:33:57,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 11:33:57,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 11:33:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 11:33:57,825 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 33 states. [2019-12-07 11:33:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:59,717 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-12-07 11:33:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:33:59,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-12-07 11:33:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:59,718 INFO L225 Difference]: With dead ends: 115 [2019-12-07 11:33:59,718 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 11:33:59,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 46 SyntacticMatches, 13 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1068, Invalid=4188, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 11:33:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 11:33:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2019-12-07 11:33:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 11:33:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-12-07 11:33:59,725 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 33 [2019-12-07 11:33:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:59,726 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-12-07 11:33:59,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 11:33:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-12-07 11:33:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:33:59,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:59,727 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:59,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:59,928 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:33:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash -275586710, now seen corresponding path program 1 times [2019-12-07 11:33:59,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:59,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268880744] [2019-12-07 11:33:59,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 11:34:00,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268880744] [2019-12-07 11:34:00,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840147179] [2019-12-07 11:34:00,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:00,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 11:34:00,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:01,136 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:01,139 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:01,319 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-07 11:34:01,503 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-12-07 11:34:02,024 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 11:34:02,193 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-07 11:34:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:02,323 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:34:02,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067183056] [2019-12-07 11:34:02,910 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-12-07 11:34:02,910 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:34:02,910 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:34:02,910 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:34:02,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:34:04,354 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:34:04,617 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 11:34:04,847 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-12-07 11:34:05,091 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-12-07 11:34:05,351 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-07 11:34:05,707 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-12-07 11:34:06,018 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-07 11:34:06,230 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 11:34:06,419 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 11:34:06,611 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 11:34:06,801 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 11:34:07,147 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 78 [2019-12-07 11:34:07,541 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 89 [2019-12-07 11:34:07,882 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 77 [2019-12-07 11:34:08,304 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 81 [2019-12-07 11:34:08,731 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 91 [2019-12-07 11:34:08,890 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:34:08,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:34:08,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 26 [2019-12-07 11:34:08,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104776577] [2019-12-07 11:34:08,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:34:08,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:34:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:34:08,892 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 26 states. [2019-12-07 11:34:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:10,291 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2019-12-07 11:34:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:34:10,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2019-12-07 11:34:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:10,292 INFO L225 Difference]: With dead ends: 149 [2019-12-07 11:34:10,292 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 11:34:10,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 18 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=599, Invalid=2823, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 11:34:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 11:34:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2019-12-07 11:34:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 11:34:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2019-12-07 11:34:10,297 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 39 [2019-12-07 11:34:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:10,298 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2019-12-07 11:34:10,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:34:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2019-12-07 11:34:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:34:10,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:10,299 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:10,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:10,500 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:34:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1004515238, now seen corresponding path program 2 times [2019-12-07 11:34:10,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:34:10,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671640432] [2019-12-07 11:34:10,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:34:10,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671640432] [2019-12-07 11:34:10,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184415460] [2019-12-07 11:34:10,595 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:10,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 11:34:10,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:34:10,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:34:10,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 11:34:10,690 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 11:34:10,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:34:10,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [11] total 15 [2019-12-07 11:34:10,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689361153] [2019-12-07 11:34:10,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:10,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:10,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:10,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:34:10,726 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 6 states. [2019-12-07 11:34:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:10,805 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2019-12-07 11:34:10,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:34:10,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 11:34:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:10,806 INFO L225 Difference]: With dead ends: 119 [2019-12-07 11:34:10,806 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:34:10,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:34:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:34:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:34:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:34:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:34:10,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-12-07 11:34:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:10,807 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:34:10,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:34:10,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:34:11,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:11,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:34:11 BoogieIcfgContainer [2019-12-07 11:34:11,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:34:11,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:34:11,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:34:11,017 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:34:11,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:26" (3/4) ... [2019-12-07 11:34:11,022 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:34:11,038 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-07 11:34:11,039 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 11:34:11,039 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:34:11,073 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0edb1a3a-cd7a-46f3-b0fd-e26cee4224e1/bin/utaipan/witness.graphml [2019-12-07 11:34:11,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:34:11,074 INFO L168 Benchmark]: Toolchain (without parser) took 44908.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 942.4 MB in the beginning and 999.2 MB in the end (delta: -56.8 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:11,074 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:11,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:11,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:11,075 INFO L168 Benchmark]: Boogie Preprocessor took 18.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:11,075 INFO L168 Benchmark]: RCFGBuilder took 251.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:11,075 INFO L168 Benchmark]: TraceAbstraction took 44359.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.8 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:11,075 INFO L168 Benchmark]: Witness Printer took 57.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 999.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:11,076 INFO L335 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 251.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44359.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.8 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 999.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 31 error locations. Result: SAFE, OverallTime: 44.3s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 208 SDtfs, 1038 SDslu, 408 SDs, 0 SdLazy, 1463 SolverSat, 665 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 294 SyntacticMatches, 55 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4895 ImplicationChecksByTransitivity, 30.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 160 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 389 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 538 ConstructedInterpolants, 108 QuantifiedInterpolants, 479571 SizeOfPredicates, 115 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 241/393 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 977, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 28, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 51, TOOLS_POST_TIME[ms]: 525, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 51, TOOLS_QUANTIFIERELIM_TIME[ms]: 513, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 93, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 86, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME[ms]: 180, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 150, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME[ms]: 11, DOMAIN_ISBOTTOM_APPLICATIONS: 28, DOMAIN_ISBOTTOM_TIME[ms]: 61, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 386, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 386, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 17, DAG_COMPRESSION_PROCESSED_NODES: 626, DAG_COMPRESSION_RETAINED_NODES: 98, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...