./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e9d0e89ee237165e6cd15cb730148b321ca31eb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:39:13,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:39:13,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:39:13,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:39:13,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:39:13,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:39:13,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:39:13,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:39:13,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:39:13,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:39:13,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:39:13,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:39:13,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:39:13,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:39:13,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:39:13,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:39:13,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:39:13,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:39:13,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:39:13,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:39:13,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:39:13,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:39:13,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:39:13,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:39:13,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:39:13,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:39:13,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:39:13,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:39:13,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:39:13,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:39:13,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:39:13,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:39:13,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:39:13,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:39:13,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:39:13,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:39:13,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:39:13,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:39:13,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:39:13,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:39:13,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:39:13,167 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:39:13,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:39:13,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:39:13,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:39:13,179 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:39:13,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:39:13,179 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:39:13,179 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:39:13,179 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:39:13,179 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:39:13,180 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:39:13,180 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:39:13,180 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:39:13,180 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:39:13,180 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:39:13,180 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:39:13,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:39:13,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:39:13,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:39:13,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:39:13,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:39:13,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:39:13,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:39:13,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:39:13,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:39:13,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:39:13,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:39:13,183 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_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e9d0e89ee237165e6cd15cb730148b321ca31eb [2019-12-07 11:39:13,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:39:13,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:39:13,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:39:13,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:39:13,291 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:39:13,292 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/../../sv-benchmarks/c/verifythis/elimination_max.c [2019-12-07 11:39:13,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/data/6e5da85d5/7cf73d0dc94b455f9edb55d052111ef0/FLAGe6df6a43d [2019-12-07 11:39:13,761 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:39:13,762 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/sv-benchmarks/c/verifythis/elimination_max.c [2019-12-07 11:39:13,766 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/data/6e5da85d5/7cf73d0dc94b455f9edb55d052111ef0/FLAGe6df6a43d [2019-12-07 11:39:13,778 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/data/6e5da85d5/7cf73d0dc94b455f9edb55d052111ef0 [2019-12-07 11:39:13,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:39:13,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:39:13,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:39:13,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:39:13,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:39:13,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:13,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505a923d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13, skipping insertion in model container [2019-12-07 11:39:13,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:13,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:39:13,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:39:13,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:39:13,958 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:39:13,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:39:13,979 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:39:13,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13 WrapperNode [2019-12-07 11:39:13,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:39:13,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:39:13,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:39:13,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:39:13,986 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:39:13" (1/1) ... [2019-12-07 11:39:13,991 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:39:13" (1/1) ... [2019-12-07 11:39:14,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:39:14,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:39:14,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:39:14,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:39:14,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... [2019-12-07 11:39:14,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:39:14,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:39:14,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:39:14,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:39:14,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/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:39:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:39:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:39:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:39:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:39:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:39:14,321 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:39:14,321 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-07 11:39:14,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:39:14 BoogieIcfgContainer [2019-12-07 11:39:14,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:39:14,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:39:14,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:39:14,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:39:14,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:39:13" (1/3) ... [2019-12-07 11:39:14,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2923f42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:39:14, skipping insertion in model container [2019-12-07 11:39:14,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:39:13" (2/3) ... [2019-12-07 11:39:14,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2923f42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:39:14, skipping insertion in model container [2019-12-07 11:39:14,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:39:14" (3/3) ... [2019-12-07 11:39:14,326 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-12-07 11:39:14,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:39:14,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 11:39:14,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 11:39:14,357 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:39:14,357 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:39:14,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:39:14,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:39:14,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:39:14,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:39:14,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:39:14,358 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:39:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-12-07 11:39:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:39:14,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:14,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:39:14,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash 114236, now seen corresponding path program 1 times [2019-12-07 11:39:14,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:14,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703303627] [2019-12-07 11:39:14,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:14,509 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:39:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703303627] [2019-12-07 11:39:14,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:14,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:39:14,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700952577] [2019-12-07 11:39:14,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:39:14,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:39:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:39:14,524 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2019-12-07 11:39:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:14,594 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-12-07 11:39:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:39:14,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 11:39:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:14,601 INFO L225 Difference]: With dead ends: 31 [2019-12-07 11:39:14,601 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 11:39:14,603 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:39:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 11:39:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-12-07 11:39:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 11:39:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 11:39:14,625 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 3 [2019-12-07 11:39:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:14,625 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 11:39:14,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:39:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-12-07 11:39:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:39:14,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:14,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:39:14,626 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:14,626 INFO L82 PathProgramCache]: Analyzing trace with hash 114235, now seen corresponding path program 1 times [2019-12-07 11:39:14,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:14,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97196722] [2019-12-07 11:39:14,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:14,647 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:39:14,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97196722] [2019-12-07 11:39:14,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:14,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:39:14,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205356700] [2019-12-07 11:39:14,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:39:14,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:39:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:39:14,649 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2019-12-07 11:39:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:14,670 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-12-07 11:39:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:39:14,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:39:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:14,671 INFO L225 Difference]: With dead ends: 22 [2019-12-07 11:39:14,671 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 11:39:14,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:39:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 11:39:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 11:39:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 11:39:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 11:39:14,674 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 3 [2019-12-07 11:39:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:14,674 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 11:39:14,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:39:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-12-07 11:39:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:39:14,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:14,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:39:14,675 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:14,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash 111895, now seen corresponding path program 1 times [2019-12-07 11:39:14,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:14,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987124055] [2019-12-07 11:39:14,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:14,708 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:39:14,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987124055] [2019-12-07 11:39:14,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:14,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:39:14,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349869036] [2019-12-07 11:39:14,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:39:14,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:14,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:39:14,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:39:14,709 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2019-12-07 11:39:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:14,772 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-07 11:39:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:39:14,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 11:39:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:14,773 INFO L225 Difference]: With dead ends: 42 [2019-12-07 11:39:14,773 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 11:39:14,773 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:39:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 11:39:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 24. [2019-12-07 11:39:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 11:39:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 11:39:14,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 3 [2019-12-07 11:39:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:14,777 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 11:39:14,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:39:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-12-07 11:39:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:39:14,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:14,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:39:14,778 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 3541289, now seen corresponding path program 1 times [2019-12-07 11:39:14,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:14,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395946094] [2019-12-07 11:39:14,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:14,825 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:39:14,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395946094] [2019-12-07 11:39:14,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:14,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:39:14,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970206854] [2019-12-07 11:39:14,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:39:14,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:39:14,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:39:14,827 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-12-07 11:39:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:14,880 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-12-07 11:39:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:39:14,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 11:39:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:14,881 INFO L225 Difference]: With dead ends: 40 [2019-12-07 11:39:14,881 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 11:39:14,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:39:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 11:39:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-12-07 11:39:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 11:39:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 11:39:14,884 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 4 [2019-12-07 11:39:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:14,884 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 11:39:14,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:39:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 11:39:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:39:14,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:14,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:39:14,885 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash 3468702, now seen corresponding path program 1 times [2019-12-07 11:39:14,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:14,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974815622] [2019-12-07 11:39:14,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:14,923 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:39:14,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974815622] [2019-12-07 11:39:14,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:14,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:39:14,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925155262] [2019-12-07 11:39:14,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:39:14,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:39:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:39:14,925 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2019-12-07 11:39:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:14,965 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-12-07 11:39:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:39:14,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 11:39:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:14,965 INFO L225 Difference]: With dead ends: 30 [2019-12-07 11:39:14,966 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 11:39:14,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:39:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 11:39:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 11:39:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 11:39:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 11:39:14,969 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2019-12-07 11:39:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:14,969 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 11:39:14,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:39:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 11:39:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:39:14,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:14,969 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 11:39:14,969 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash -961472180, now seen corresponding path program 1 times [2019-12-07 11:39:14,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:14,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999232413] [2019-12-07 11:39:14,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:15,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999232413] [2019-12-07 11:39:15,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951344106] [2019-12-07 11:39:15,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:15,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:39:15,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:39:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:15,138 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:39:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-12-07 11:39:15,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:39:15,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-12-07 11:39:15,188 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:39:15,204 INFO L614 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2019-12-07 11:39:15,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-12-07 11:39:15,208 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:39:15,215 INFO L614 ElimStorePlain]: treesize reduction 9, result has 65.4 percent of original size [2019-12-07 11:39:15,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:39:15,215 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:17 [2019-12-07 11:39:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995351756] [2019-12-07 11:39:15,260 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 11:39:15,260 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:39:15,263 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:39:15,268 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:39:15,268 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:39:15,467 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:39:15,891 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:39:15,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:39:15,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-12-07 11:39:15,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339382858] [2019-12-07 11:39:15,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:39:15,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:39:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:39:15,893 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2019-12-07 11:39:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:16,137 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-12-07 11:39:16,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:39:16,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-12-07 11:39:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:16,138 INFO L225 Difference]: With dead ends: 35 [2019-12-07 11:39:16,138 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 11:39:16,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:39:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 11:39:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 18. [2019-12-07 11:39:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 11:39:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-12-07 11:39:16,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 6 [2019-12-07 11:39:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:16,142 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-12-07 11:39:16,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:39:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-12-07 11:39:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:39:16,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:16,143 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:16,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:16,344 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1219868575, now seen corresponding path program 1 times [2019-12-07 11:39:16,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:16,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293923272] [2019-12-07 11:39:16,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:16,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293923272] [2019-12-07 11:39:16,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847297593] [2019-12-07 11:39:16,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:16,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:39:16,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:39:16,547 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:39:16,547 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:39:16,577 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:39:16,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:39:16,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 12 [2019-12-07 11:39:16,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143112855] [2019-12-07 11:39:16,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:39:16,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:39:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:39:16,579 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2019-12-07 11:39:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:16,633 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 11:39:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:39:16,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-12-07 11:39:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:16,634 INFO L225 Difference]: With dead ends: 33 [2019-12-07 11:39:16,634 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 11:39:16,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:39:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 11:39:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-12-07 11:39:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 11:39:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-12-07 11:39:16,637 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2019-12-07 11:39:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:16,637 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-12-07 11:39:16,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:39:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-12-07 11:39:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:39:16,638 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:16,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:16,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:16,839 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 838816988, now seen corresponding path program 1 times [2019-12-07 11:39:16,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:16,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379205262] [2019-12-07 11:39:16,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:39:16,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379205262] [2019-12-07 11:39:16,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:16,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:39:16,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052479802] [2019-12-07 11:39:16,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:39:16,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:39:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:39:16,890 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2019-12-07 11:39:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:16,912 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-12-07 11:39:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:39:16,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 11:39:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:16,913 INFO L225 Difference]: With dead ends: 24 [2019-12-07 11:39:16,913 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 11:39:16,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:39:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 11:39:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 11:39:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 11:39:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 11:39:16,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2019-12-07 11:39:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:16,918 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 11:39:16,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:39:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-12-07 11:39:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:39:16,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:16,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:16,919 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1350722785, now seen corresponding path program 1 times [2019-12-07 11:39:16,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:16,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544806576] [2019-12-07 11:39:16,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:39:16,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544806576] [2019-12-07 11:39:16,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:39:16,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53506031] [2019-12-07 11:39:16,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:39:16,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:39:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:39:16,981 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-12-07 11:39:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:17,002 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-12-07 11:39:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:39:17,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 11:39:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:17,003 INFO L225 Difference]: With dead ends: 23 [2019-12-07 11:39:17,003 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 11:39:17,003 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:39:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 11:39:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 11:39:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 11:39:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-12-07 11:39:17,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2019-12-07 11:39:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:17,005 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 11:39:17,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:39:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-12-07 11:39:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:39:17,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:17,005 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:17,005 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1636364502, now seen corresponding path program 1 times [2019-12-07 11:39:17,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:17,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74538236] [2019-12-07 11:39:17,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:17,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74538236] [2019-12-07 11:39:17,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569665011] [2019-12-07 11:39:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:17,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:39:17,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:39:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:17,137 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:39:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:17,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726364247] [2019-12-07 11:39:17,196 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:39:17,196 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:39:17,196 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:39:17,196 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:39:17,197 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:39:17,356 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:39:17,866 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:39:17,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:39:17,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2019-12-07 11:39:17,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133806839] [2019-12-07 11:39:17,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:39:17,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:17,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:39:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:39:17,868 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 18 states. [2019-12-07 11:39:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:18,044 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-12-07 11:39:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:39:18,044 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 12 [2019-12-07 11:39:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:18,045 INFO L225 Difference]: With dead ends: 19 [2019-12-07 11:39:18,045 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 11:39:18,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:39:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 11:39:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-12-07 11:39:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 11:39:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 11:39:18,047 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-12-07 11:39:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:18,047 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 11:39:18,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:39:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-12-07 11:39:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:39:18,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:18,047 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:18,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:18,248 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:39:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1056104752, now seen corresponding path program 2 times [2019-12-07 11:39:18,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:18,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541190582] [2019-12-07 11:39:18,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:18,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541190582] [2019-12-07 11:39:18,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197529822] [2019-12-07 11:39:18,320 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:18,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 11:39:18,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:39:18,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:39:18,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:39:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:39:18,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:39:20,056 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 11:39:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:39:22,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14613391] [2019-12-07 11:39:22,132 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:39:22,132 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:39:22,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:39:22,133 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:39:22,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:39:22,303 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:39:22,840 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:39:22,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:39:22,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2019-12-07 11:39:22,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668389536] [2019-12-07 11:39:22,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:39:22,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:22,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:39:22,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=603, Unknown=1, NotChecked=0, Total=702 [2019-12-07 11:39:22,841 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 20 states. [2019-12-07 11:39:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:23,263 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-12-07 11:39:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:39:23,264 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-07 11:39:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:23,264 INFO L225 Difference]: With dead ends: 16 [2019-12-07 11:39:23,264 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:39:23,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=228, Invalid=961, Unknown=1, NotChecked=0, Total=1190 [2019-12-07 11:39:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:39:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:39:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:39:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:39:23,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-12-07 11:39:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:23,266 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:39:23,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:39:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:39:23,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:39:23,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:23,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:39:23 BoogieIcfgContainer [2019-12-07 11:39:23,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:39:23,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:39:23,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:39:23,474 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:39:23,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:39:14" (3/4) ... [2019-12-07 11:39:23,477 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:39:23,486 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-12-07 11:39:23,486 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 11:39:23,487 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:39:23,519 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ec31bec4-b831-49fe-a391-8b2dfd4db11b/bin/utaipan/witness.graphml [2019-12-07 11:39:23,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:39:23,520 INFO L168 Benchmark]: Toolchain (without parser) took 9738.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.9 MB in the beginning and 948.5 MB in the end (delta: -7.7 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:23,520 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:39:23,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:23,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.50 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:39:23,521 INFO L168 Benchmark]: Boogie Preprocessor took 16.85 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:39:23,521 INFO L168 Benchmark]: RCFGBuilder took 298.87 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:23,521 INFO L168 Benchmark]: TraceAbstraction took 9151.27 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 950.6 MB in the end (delta: 116.9 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:23,521 INFO L168 Benchmark]: Witness Printer took 45.07 ms. Allocated memory is still 1.2 GB. Free memory was 950.6 MB in the beginning and 948.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:23,523 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.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.85 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. * RCFGBuilder took 298.87 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9151.27 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 950.6 MB in the end (delta: 116.9 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. * Witness Printer took 45.07 ms. Allocated memory is still 1.2 GB. Free memory was 950.6 MB in the beginning and 948.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 16 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 53 SDtfs, 361 SDslu, 72 SDs, 0 SdLazy, 628 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, 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, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 146 ConstructedInterpolants, 6 QuantifiedInterpolants, 22093 SizeOfPredicates, 35 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 22/47 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 correct! Received shutdown request...