./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:46:48,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:46:48,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:46:48,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:46:48,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:46:48,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:46:48,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:46:48,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:46:48,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:46:48,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:46:48,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:46:48,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:46:48,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:46:48,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:46:48,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:46:48,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:46:48,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:46:48,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:46:48,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:46:48,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:46:48,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:46:48,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:46:48,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:46:48,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:46:48,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:46:48,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:46:48,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:46:48,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:46:48,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:46:48,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:46:48,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:46:48,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:46:48,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:46:48,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:46:48,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:46:48,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:46:48,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:46:48,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:46:48,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:46:48,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:46:48,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:46:48,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2019-12-07 11:46:48,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:46:48,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:46:48,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:46:48,449 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:46:48,449 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:46:48,450 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:46:48,450 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:46:48,450 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:46:48,450 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:46:48,450 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:46:48,451 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:46:48,451 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:46:48,451 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:46:48,451 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:46:48,451 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:46:48,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:46:48,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:46:48,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:46:48,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:46:48,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:46:48,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:46:48,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:46:48,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:46:48,453 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:46:48,454 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:46:48,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:46:48,454 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:46:48,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:46:48,454 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:46:48,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:46:48,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:46:48,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:46:48,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:46:48,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:46:48,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:46:48,456 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:46:48,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:46:48,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:46:48,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:46:48,456 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_08978931-e46b-4634-8f62-10040b777f4a/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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-12-07 11:46:48,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:46:48,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:46:48,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:46:48,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:46:48,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:46:48,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/../../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-12-07 11:46:48,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/data/a89a599d4/b54b26853b1e4cdfbd6a912715c29e57/FLAGca4401fb3 [2019-12-07 11:46:49,027 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:46:49,027 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-12-07 11:46:49,035 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/data/a89a599d4/b54b26853b1e4cdfbd6a912715c29e57/FLAGca4401fb3 [2019-12-07 11:46:49,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/data/a89a599d4/b54b26853b1e4cdfbd6a912715c29e57 [2019-12-07 11:46:49,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:46:49,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:46:49,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:46:49,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:46:49,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:46:49,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e10742b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49, skipping insertion in model container [2019-12-07 11:46:49,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:46:49,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:46:49,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:46:49,300 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:46:49,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:46:49,359 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:46:49,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49 WrapperNode [2019-12-07 11:46:49,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:46:49,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:46:49,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:46:49,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:46:49,365 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:46:49" (1/1) ... [2019-12-07 11:46:49,375 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:46:49" (1/1) ... [2019-12-07 11:46:49,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:46:49,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:46:49,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:46:49,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:46:49,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... [2019-12-07 11:46:49,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:46:49,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:46:49,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:46:49,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:46:49,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/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:46:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:46:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:46:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:46:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:46:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:46:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:46:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:46:49,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:46:49,721 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:46:49,721 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-12-07 11:46:49,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:46:49 BoogieIcfgContainer [2019-12-07 11:46:49,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:46:49,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:46:49,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:46:49,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:46:49,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:46:49" (1/3) ... [2019-12-07 11:46:49,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cec2910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:46:49, skipping insertion in model container [2019-12-07 11:46:49,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:49" (2/3) ... [2019-12-07 11:46:49,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cec2910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:46:49, skipping insertion in model container [2019-12-07 11:46:49,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:46:49" (3/3) ... [2019-12-07 11:46:49,727 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-12-07 11:46:49,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:46:49,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-12-07 11:46:49,745 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-12-07 11:46:49,758 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:46:49,758 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:46:49,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:46:49,758 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:46:49,758 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:46:49,758 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:46:49,758 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:46:49,758 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:46:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-12-07 11:46:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:46:49,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:49,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:46:49,775 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash 5206411, now seen corresponding path program 1 times [2019-12-07 11:46:49,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:49,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868949851] [2019-12-07 11:46:49,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:49,864 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:46:49,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868949851] [2019-12-07 11:46:49,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:49,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:46:49,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074130338] [2019-12-07 11:46:49,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:46:49,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:46:49,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:46:49,879 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-12-07 11:46:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:49,889 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-12-07 11:46:49,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:46:49,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 11:46:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:49,897 INFO L225 Difference]: With dead ends: 65 [2019-12-07 11:46:49,897 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 11:46:49,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:46:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 11:46:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 11:46:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 11:46:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-12-07 11:46:49,921 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 4 [2019-12-07 11:46:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:49,922 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-12-07 11:46:49,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:46:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-12-07 11:46:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:46:49,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:49,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:46:49,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:49,923 INFO L82 PathProgramCache]: Analyzing trace with hash 161363083, now seen corresponding path program 1 times [2019-12-07 11:46:49,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:49,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883054893] [2019-12-07 11:46:49,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:49,958 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:46:49,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883054893] [2019-12-07 11:46:49,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:49,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:46:49,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465887021] [2019-12-07 11:46:49,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:49,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:49,960 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 4 states. [2019-12-07 11:46:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,055 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-12-07 11:46:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:46:50,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 11:46:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,058 INFO L225 Difference]: With dead ends: 82 [2019-12-07 11:46:50,058 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 11:46:50,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:46:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 11:46:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-12-07 11:46:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 11:46:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-12-07 11:46:50,068 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 5 [2019-12-07 11:46:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,068 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-12-07 11:46:50,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-12-07 11:46:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:46:50,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:46:50,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 161363084, now seen corresponding path program 1 times [2019-12-07 11:46:50,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349035379] [2019-12-07 11:46:50,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,109 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:46:50,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349035379] [2019-12-07 11:46:50,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:46:50,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761319159] [2019-12-07 11:46:50,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:50,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:50,111 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 4 states. [2019-12-07 11:46:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,208 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2019-12-07 11:46:50,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:46:50,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 11:46:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,210 INFO L225 Difference]: With dead ends: 85 [2019-12-07 11:46:50,210 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 11:46:50,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:46:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 11:46:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2019-12-07 11:46:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 11:46:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-12-07 11:46:50,217 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 5 [2019-12-07 11:46:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,217 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-12-07 11:46:50,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-12-07 11:46:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:46:50,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:50,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1561731641, now seen corresponding path program 1 times [2019-12-07 11:46:50,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306928862] [2019-12-07 11:46:50,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,251 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:46:50,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306928862] [2019-12-07 11:46:50,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:50,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553981173] [2019-12-07 11:46:50,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:46:50,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:46:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:50,253 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 3 states. [2019-12-07 11:46:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,265 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-12-07 11:46:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:50,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 11:46:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,267 INFO L225 Difference]: With dead ends: 122 [2019-12-07 11:46:50,267 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 11:46:50,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 11:46:50,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 85. [2019-12-07 11:46:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 11:46:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2019-12-07 11:46:50,275 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 11 [2019-12-07 11:46:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,275 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2019-12-07 11:46:50,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:46:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2019-12-07 11:46:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:46:50,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:50,276 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1561423811, now seen corresponding path program 1 times [2019-12-07 11:46:50,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756927158] [2019-12-07 11:46:50,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,378 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:46:50,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756927158] [2019-12-07 11:46:50,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:46:50,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71568206] [2019-12-07 11:46:50,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:46:50,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:46:50,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:46:50,379 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 6 states. [2019-12-07 11:46:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,532 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-12-07 11:46:50,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:46:50,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 11:46:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,533 INFO L225 Difference]: With dead ends: 96 [2019-12-07 11:46:50,533 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 11:46:50,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:46:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 11:46:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2019-12-07 11:46:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 11:46:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2019-12-07 11:46:50,538 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 11 [2019-12-07 11:46:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,538 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2019-12-07 11:46:50,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:46:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2019-12-07 11:46:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:46:50,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:50,539 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1128127902, now seen corresponding path program 1 times [2019-12-07 11:46:50,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017512978] [2019-12-07 11:46:50,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,568 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:46:50,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017512978] [2019-12-07 11:46:50,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:46:50,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186518587] [2019-12-07 11:46:50,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:50,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:50,570 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 4 states. [2019-12-07 11:46:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,625 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2019-12-07 11:46:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:46:50,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 11:46:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,626 INFO L225 Difference]: With dead ends: 91 [2019-12-07 11:46:50,626 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 11:46:50,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:46:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 11:46:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-12-07 11:46:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 11:46:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2019-12-07 11:46:50,631 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 12 [2019-12-07 11:46:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,631 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-12-07 11:46:50,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2019-12-07 11:46:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:46:50,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:50,632 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1128130371, now seen corresponding path program 1 times [2019-12-07 11:46:50,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536068196] [2019-12-07 11:46:50,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,680 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:46:50,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536068196] [2019-12-07 11:46:50,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:46:50,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232124829] [2019-12-07 11:46:50,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:46:50,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:46:50,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:46:50,681 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 7 states. [2019-12-07 11:46:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,760 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2019-12-07 11:46:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:46:50,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-12-07 11:46:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,761 INFO L225 Difference]: With dead ends: 95 [2019-12-07 11:46:50,761 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 11:46:50,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:46:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 11:46:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-12-07 11:46:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 11:46:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2019-12-07 11:46:50,766 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 12 [2019-12-07 11:46:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,766 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2019-12-07 11:46:50,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:46:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2019-12-07 11:46:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:46:50,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:50,767 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash 612303281, now seen corresponding path program 1 times [2019-12-07 11:46:50,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235843122] [2019-12-07 11:46:50,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,795 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:46:50,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235843122] [2019-12-07 11:46:50,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:50,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870089112] [2019-12-07 11:46:50,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:46:50,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:46:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:46:50,797 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 5 states. [2019-12-07 11:46:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:50,873 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-12-07 11:46:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:46:50,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 11:46:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:50,875 INFO L225 Difference]: With dead ends: 96 [2019-12-07 11:46:50,875 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 11:46:50,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:46:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 11:46:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2019-12-07 11:46:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 11:46:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2019-12-07 11:46:50,879 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 13 [2019-12-07 11:46:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:50,880 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2019-12-07 11:46:50,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:46:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2019-12-07 11:46:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:46:50,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:50,881 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:50,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash 301419363, now seen corresponding path program 1 times [2019-12-07 11:46:50,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:50,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584992262] [2019-12-07 11:46:50,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:50,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584992262] [2019-12-07 11:46:50,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:50,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:46:50,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960600898] [2019-12-07 11:46:50,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:46:50,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:46:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:46:50,909 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 5 states. [2019-12-07 11:46:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:51,005 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2019-12-07 11:46:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:46:51,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 11:46:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:51,006 INFO L225 Difference]: With dead ends: 98 [2019-12-07 11:46:51,006 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 11:46:51,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:46:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 11:46:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2019-12-07 11:46:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 11:46:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2019-12-07 11:46:51,009 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 13 [2019-12-07 11:46:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:51,010 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2019-12-07 11:46:51,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:46:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2019-12-07 11:46:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:46:51,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:51,010 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:51,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash 301419364, now seen corresponding path program 1 times [2019-12-07 11:46:51,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:51,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682884203] [2019-12-07 11:46:51,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:51,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682884203] [2019-12-07 11:46:51,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:51,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:46:51,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507256338] [2019-12-07 11:46:51,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:46:51,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:51,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:46:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:46:51,044 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 5 states. [2019-12-07 11:46:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:51,153 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-12-07 11:46:51,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:46:51,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 11:46:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:51,154 INFO L225 Difference]: With dead ends: 109 [2019-12-07 11:46:51,154 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 11:46:51,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:46:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 11:46:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 76. [2019-12-07 11:46:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 11:46:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-12-07 11:46:51,157 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 13 [2019-12-07 11:46:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:51,157 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-12-07 11:46:51,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:46:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-12-07 11:46:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:46:51,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:51,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:51,158 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1799160324, now seen corresponding path program 1 times [2019-12-07 11:46:51,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:51,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909717256] [2019-12-07 11:46:51,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:51,211 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:46:51,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909717256] [2019-12-07 11:46:51,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:51,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:51,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660972698] [2019-12-07 11:46:51,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:46:51,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:51,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:46:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:46:51,213 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 5 states. [2019-12-07 11:46:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:51,301 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2019-12-07 11:46:51,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:46:51,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:46:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:51,302 INFO L225 Difference]: With dead ends: 91 [2019-12-07 11:46:51,302 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 11:46:51,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:46:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 11:46:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2019-12-07 11:46:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 11:46:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2019-12-07 11:46:51,304 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 14 [2019-12-07 11:46:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:51,304 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2019-12-07 11:46:51,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:46:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2019-12-07 11:46:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:46:51,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:51,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:51,305 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1801532677, now seen corresponding path program 1 times [2019-12-07 11:46:51,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:51,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529067547] [2019-12-07 11:46:51,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:51,328 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:46:51,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529067547] [2019-12-07 11:46:51,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:51,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:46:51,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201847423] [2019-12-07 11:46:51,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:46:51,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:46:51,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:46:51,329 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand 6 states. [2019-12-07 11:46:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:51,424 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-12-07 11:46:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:46:51,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 11:46:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:51,425 INFO L225 Difference]: With dead ends: 91 [2019-12-07 11:46:51,425 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 11:46:51,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:46:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 11:46:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2019-12-07 11:46:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 11:46:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-12-07 11:46:51,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 14 [2019-12-07 11:46:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:51,428 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-12-07 11:46:51,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:46:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-12-07 11:46:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:46:51,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:51,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:51,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 12938274, now seen corresponding path program 1 times [2019-12-07 11:46:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:51,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226047707] [2019-12-07 11:46:51,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:51,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226047707] [2019-12-07 11:46:51,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:51,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:46:51,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331019619] [2019-12-07 11:46:51,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:46:51,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:46:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:46:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:46:51,487 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 8 states. [2019-12-07 11:46:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:51,674 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-12-07 11:46:51,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:46:51,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 11:46:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:51,675 INFO L225 Difference]: With dead ends: 92 [2019-12-07 11:46:51,675 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 11:46:51,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:46:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 11:46:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2019-12-07 11:46:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 11:46:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-12-07 11:46:51,677 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 15 [2019-12-07 11:46:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:51,677 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-12-07 11:46:51,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:46:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-12-07 11:46:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:46:51,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:51,678 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:51,678 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 11:46:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1778648219, now seen corresponding path program 1 times [2019-12-07 11:46:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:46:51,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459287026] [2019-12-07 11:46:51,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:46:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:46:51,710 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:46:51,710 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:46:51,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:46:51 BoogieIcfgContainer [2019-12-07 11:46:51,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:46:51,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:46:51,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:46:51,730 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:46:51,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:46:49" (3/4) ... [2019-12-07 11:46:51,732 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:46:51,766 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_08978931-e46b-4634-8f62-10040b777f4a/bin/utaipan/witness.graphml [2019-12-07 11:46:51,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:46:51,767 INFO L168 Benchmark]: Toolchain (without parser) took 2719.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 934.5 MB in the beginning and 913.7 MB in the end (delta: 20.8 MB). Peak memory consumption was 124.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:51,768 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:46:51,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:51,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.00 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:51,768 INFO L168 Benchmark]: Boogie Preprocessor took 20.15 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:46:51,769 INFO L168 Benchmark]: RCFGBuilder took 311.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:51,769 INFO L168 Benchmark]: TraceAbstraction took 2006.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 915.4 MB in the end (delta: 121.9 MB). Peak memory consumption was 121.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:51,769 INFO L168 Benchmark]: Witness Printer took 35.83 ms. Allocated memory is still 1.1 GB. Free memory was 915.4 MB in the beginning and 913.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:51,771 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.00 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.15 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 311.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2006.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 915.4 MB in the end (delta: 121.9 MB). Peak memory consumption was 121.9 MB. Max. memory is 11.5 GB. * Witness Printer took 35.83 ms. Allocated memory is still 1.1 GB. Free memory was 915.4 MB in the beginning and 913.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 562]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] int flag = 1; [L522] List a = (List) malloc(sizeof(struct node)); [L523] COND FALSE !(a == 0) [L524] List t; [L525] List p = a; [L526] COND TRUE __VERIFIER_nondet_int() [L527] COND TRUE \read(flag) [L528] p->h = 2 [L529] flag = 0 [L534] t = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(t == 0) [L536] p->n = t [L537] EXPR p->n [L537] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 [L540] p = a [L541] flag = 1 [L542] EXPR p->h [L542] COND TRUE p->h != 3 [L543] COND TRUE \read(flag) [L544] flag = 0 [L545] EXPR p->h [L545] COND TRUE p->h != 1 [L562] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 30 error locations. Result: UNSAFE, OverallTime: 1.9s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 591 SDtfs, 1050 SDslu, 733 SDs, 0 SdLazy, 1000 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=8, 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, 13 MinimizatonAttempts, 165 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 8637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...