./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17d20a29a9e9cc6560e9aa0daac36f5de29f992c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 14:44:20,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:44:20,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:44:20,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:44:20,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:44:20,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:44:20,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:44:20,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:44:20,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:44:20,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:44:20,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:44:20,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:44:20,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:44:20,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:44:20,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:44:20,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:44:20,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:44:20,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:44:20,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:44:20,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:44:20,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:44:20,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:44:20,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:44:20,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:44:20,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:44:20,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:44:20,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:44:20,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:44:20,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:44:20,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:44:20,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:44:20,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:44:20,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:44:20,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:44:20,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:44:20,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:44:20,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:44:20,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:44:20,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:44:20,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:44:20,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:44:20,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 14:44:20,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:44:20,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:44:20,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:44:20,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:44:20,172 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:44:20,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:44:20,174 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:44:20,174 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:44:20,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:44:20,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:44:20,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:44:20,175 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:44:20,175 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:44:20,176 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:44:20,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:44:20,176 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:44:20,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:44:20,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:44:20,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:44:20,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:44:20,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:44:20,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:44:20,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:44:20,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:44:20,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:44:20,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 14:44:20,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 14:44:20,179 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:44:20,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 17d20a29a9e9cc6560e9aa0daac36f5de29f992c [2019-11-28 14:44:20,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:44:20,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:44:20,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:44:20,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:44:20,500 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:44:20,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-28 14:44:20,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cdcdf1df/06883bcaca9d43a5a8438a21a02720c7/FLAGef07d528c [2019-11-28 14:44:21,062 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:44:21,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-28 14:44:21,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cdcdf1df/06883bcaca9d43a5a8438a21a02720c7/FLAGef07d528c [2019-11-28 14:44:21,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cdcdf1df/06883bcaca9d43a5a8438a21a02720c7 [2019-11-28 14:44:21,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:44:21,432 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:44:21,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:44:21,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:44:21,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:44:21,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0242b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21, skipping insertion in model container [2019-11-28 14:44:21,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:44:21,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:44:21,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:44:21,687 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 14:44:21,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:44:21,786 INFO L208 MainTranslator]: Completed translation [2019-11-28 14:44:21,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21 WrapperNode [2019-11-28 14:44:21,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:44:21,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 14:44:21,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 14:44:21,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 14:44:21,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... [2019-11-28 14:44:21,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 14:44:21,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 14:44:21,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 14:44:21,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 14:44:21,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 14:44:21,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 14:44:21,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 14:44:21,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 14:44:21,878 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-28 14:44:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 14:44:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 14:44:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 14:44:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 14:44:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 14:44:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 14:44:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 14:44:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 14:44:21,880 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-28 14:44:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 14:44:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 14:44:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 14:44:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 14:44:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 14:44:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 14:44:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 14:44:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 14:44:22,217 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 14:44:22,218 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 14:44:22,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:44:22 BoogieIcfgContainer [2019-11-28 14:44:22,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 14:44:22,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 14:44:22,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 14:44:22,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 14:44:22,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:44:21" (1/3) ... [2019-11-28 14:44:22,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e663b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:44:22, skipping insertion in model container [2019-11-28 14:44:22,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:44:21" (2/3) ... [2019-11-28 14:44:22,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e663b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:44:22, skipping insertion in model container [2019-11-28 14:44:22,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:44:22" (3/3) ... [2019-11-28 14:44:22,226 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-11-28 14:44:22,235 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 14:44:22,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-28 14:44:22,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-28 14:44:22,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 14:44:22,271 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 14:44:22,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 14:44:22,271 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 14:44:22,271 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 14:44:22,271 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 14:44:22,271 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 14:44:22,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 14:44:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-28 14:44:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 14:44:22,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:22,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:22,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-11-28 14:44:22,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:22,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48462264] [2019-11-28 14:44:22,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:22,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48462264] [2019-11-28 14:44:22,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:22,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 14:44:22,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377422747] [2019-11-28 14:44:22,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 14:44:22,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 14:44:22,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:44:22,637 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-28 14:44:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:22,983 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-28 14:44:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 14:44:22,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-28 14:44:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:23,000 INFO L225 Difference]: With dead ends: 52 [2019-11-28 14:44:23,000 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 14:44:23,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:44:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 14:44:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 14:44:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 14:44:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-28 14:44:23,045 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-11-28 14:44:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:23,047 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-28 14:44:23,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 14:44:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-28 14:44:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 14:44:23,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:23,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:23,050 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-11-28 14:44:23,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:23,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277465901] [2019-11-28 14:44:23,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:23,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277465901] [2019-11-28 14:44:23,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:23,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 14:44:23,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589151708] [2019-11-28 14:44:23,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 14:44:23,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 14:44:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:44:23,189 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-28 14:44:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:23,422 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-28 14:44:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 14:44:23,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-28 14:44:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:23,424 INFO L225 Difference]: With dead ends: 48 [2019-11-28 14:44:23,424 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 14:44:23,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:44:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 14:44:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 14:44:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 14:44:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-28 14:44:23,434 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-11-28 14:44:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:23,435 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-28 14:44:23,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 14:44:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-28 14:44:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 14:44:23,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:23,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:23,437 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-11-28 14:44:23,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:23,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933250106] [2019-11-28 14:44:23,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:23,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933250106] [2019-11-28 14:44:23,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:23,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 14:44:23,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390537637] [2019-11-28 14:44:23,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 14:44:23,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:23,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 14:44:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:44:23,595 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-11-28 14:44:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:23,825 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 14:44:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 14:44:23,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 14:44:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:23,827 INFO L225 Difference]: With dead ends: 47 [2019-11-28 14:44:23,828 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 14:44:23,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:44:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 14:44:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 14:44:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 14:44:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-28 14:44:23,844 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-28 14:44:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:23,845 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-28 14:44:23,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 14:44:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-28 14:44:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 14:44:23,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:23,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:23,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-11-28 14:44:23,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:23,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099142557] [2019-11-28 14:44:23,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:24,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099142557] [2019-11-28 14:44:24,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:24,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 14:44:24,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988363612] [2019-11-28 14:44:24,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 14:44:24,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:24,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 14:44:24,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 14:44:24,017 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-11-28 14:44:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:24,291 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-28 14:44:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 14:44:24,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 14:44:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:24,293 INFO L225 Difference]: With dead ends: 43 [2019-11-28 14:44:24,293 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 14:44:24,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 14:44:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 14:44:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 14:44:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 14:44:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 14:44:24,309 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-11-28 14:44:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:24,312 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 14:44:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 14:44:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 14:44:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 14:44:24,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:24,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:24,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-11-28 14:44:24,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:24,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607330154] [2019-11-28 14:44:24,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:24,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607330154] [2019-11-28 14:44:24,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:24,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 14:44:24,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259699229] [2019-11-28 14:44:24,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 14:44:24,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:24,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 14:44:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:44:24,479 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-11-28 14:44:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:25,085 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-28 14:44:25,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 14:44:25,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-28 14:44:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:25,091 INFO L225 Difference]: With dead ends: 77 [2019-11-28 14:44:25,091 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 14:44:25,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-28 14:44:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 14:44:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-28 14:44:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 14:44:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-28 14:44:25,103 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-11-28 14:44:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:25,104 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-28 14:44:25,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 14:44:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-28 14:44:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 14:44:25,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:25,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:25,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-11-28 14:44:25,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:25,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868857867] [2019-11-28 14:44:25,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:25,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868857867] [2019-11-28 14:44:25,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:25,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 14:44:25,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317868899] [2019-11-28 14:44:25,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 14:44:25,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:25,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 14:44:25,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 14:44:25,233 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-11-28 14:44:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:25,449 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-28 14:44:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 14:44:25,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 14:44:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:25,455 INFO L225 Difference]: With dead ends: 60 [2019-11-28 14:44:25,455 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 14:44:25,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 14:44:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 14:44:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 14:44:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 14:44:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-28 14:44:25,474 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-28 14:44:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:25,476 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-28 14:44:25,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 14:44:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-28 14:44:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 14:44:25,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:25,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:25,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-11-28 14:44:25,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:25,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886720872] [2019-11-28 14:44:25,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:25,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886720872] [2019-11-28 14:44:25,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:44:25,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 14:44:25,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707892683] [2019-11-28 14:44:25,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:44:25,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:25,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:44:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:44:25,642 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-11-28 14:44:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:26,148 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-28 14:44:26,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 14:44:26,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 14:44:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:26,150 INFO L225 Difference]: With dead ends: 68 [2019-11-28 14:44:26,150 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 14:44:26,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-28 14:44:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 14:44:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-11-28 14:44:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 14:44:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-28 14:44:26,159 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-11-28 14:44:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:26,159 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-28 14:44:26,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:44:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-28 14:44:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 14:44:26,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:26,161 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:26,162 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-11-28 14:44:26,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:26,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533613549] [2019-11-28 14:44:26,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:26,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533613549] [2019-11-28 14:44:26,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824515661] [2019-11-28 14:44:26,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 14:44:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:26,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 14:44:26,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:44:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:26,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:44:26,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-28 14:44:26,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509297087] [2019-11-28 14:44:26,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 14:44:26,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 14:44:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 14:44:26,607 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-11-28 14:44:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:27,702 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-11-28 14:44:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 14:44:27,703 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-28 14:44:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:27,704 INFO L225 Difference]: With dead ends: 80 [2019-11-28 14:44:27,705 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 14:44:27,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 14:44:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 14:44:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-28 14:44:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 14:44:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-28 14:44:27,715 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-11-28 14:44:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:27,716 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-28 14:44:27,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 14:44:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-28 14:44:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 14:44:27,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:27,718 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:27,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:27,922 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-11-28 14:44:27,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:27,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269190617] [2019-11-28 14:44:27,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:28,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269190617] [2019-11-28 14:44:28,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263278650] [2019-11-28 14:44:28,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 14:44:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:28,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 14:44:28,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:44:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:28,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:44:28,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-28 14:44:28,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133931366] [2019-11-28 14:44:28,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 14:44:28,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 14:44:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-28 14:44:28,666 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-11-28 14:44:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:33,409 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-28 14:44:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 14:44:33,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-28 14:44:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:33,411 INFO L225 Difference]: With dead ends: 110 [2019-11-28 14:44:33,411 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 14:44:33,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 14:44:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 14:44:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-11-28 14:44:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 14:44:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-28 14:44:33,436 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-11-28 14:44:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:33,437 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-28 14:44:33,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 14:44:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-28 14:44:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 14:44:33,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:33,439 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:33,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:33,641 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:33,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-11-28 14:44:33,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:33,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190183698] [2019-11-28 14:44:33,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 14:44:33,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190183698] [2019-11-28 14:44:33,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154366790] [2019-11-28 14:44:33,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 14:44:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:33,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 14:44:33,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:44:33,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 14:44:33,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:44:33,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:44:33,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:44:33,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 14:44:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:34,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:44:34,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 14:44:34,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512375975] [2019-11-28 14:44:34,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 14:44:34,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 14:44:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-28 14:44:34,380 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-11-28 14:44:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:36,149 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-11-28 14:44:36,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 14:44:36,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-28 14:44:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:36,152 INFO L225 Difference]: With dead ends: 115 [2019-11-28 14:44:36,152 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 14:44:36,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 14:44:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 14:44:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-11-28 14:44:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 14:44:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-28 14:44:36,176 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-11-28 14:44:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:36,177 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-28 14:44:36,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 14:44:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-28 14:44:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 14:44:36,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:36,179 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:36,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:36,383 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-11-28 14:44:36,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:36,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320784566] [2019-11-28 14:44:36,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:36,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320784566] [2019-11-28 14:44:36,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364071058] [2019-11-28 14:44:36,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 14:44:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:36,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 14:44:36,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:44:36,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-11-28 14:44:36,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:44:36,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:44:36,680 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:44:36,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-28 14:44:38,819 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-28 14:44:38,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 23 [2019-11-28 14:44:38,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:44:38,892 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:44:38,892 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 14:44:38,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-28 14:44:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:38,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 14:44:38,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-28 14:44:38,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686570389] [2019-11-28 14:44:38,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:44:38,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:38,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:44:38,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-28 14:44:38,922 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-11-28 14:44:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:39,077 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-28 14:44:39,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 14:44:39,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-28 14:44:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:39,080 INFO L225 Difference]: With dead ends: 83 [2019-11-28 14:44:39,080 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 14:44:39,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-11-28 14:44:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 14:44:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-28 14:44:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 14:44:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-28 14:44:39,085 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-11-28 14:44:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:39,085 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-28 14:44:39,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:44:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-28 14:44:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 14:44:39,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:39,087 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:39,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:39,293 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-11-28 14:44:39,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:39,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719304426] [2019-11-28 14:44:39,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 14:44:39,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719304426] [2019-11-28 14:44:39,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488062824] [2019-11-28 14:44:39,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:39,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 14:44:39,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:44:39,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 14:44:39,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:44:39,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:44:39,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:44:39,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 14:44:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:44:39,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:44:39,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 14:44:39,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734432189] [2019-11-28 14:44:39,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 14:44:39,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 14:44:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-28 14:44:39,869 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-11-28 14:44:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:41,097 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 14:44:41,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 14:44:41,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-28 14:44:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:41,099 INFO L225 Difference]: With dead ends: 63 [2019-11-28 14:44:41,099 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 14:44:41,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 14:44:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 14:44:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-28 14:44:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 14:44:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-28 14:44:41,104 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-11-28 14:44:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:41,104 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-28 14:44:41,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 14:44:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-28 14:44:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 14:44:41,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:44:41,106 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:44:41,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:41,310 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 14:44:41,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:44:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-11-28 14:44:41,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 14:44:41,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765933850] [2019-11-28 14:44:41,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 14:44:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 14:44:41,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765933850] [2019-11-28 14:44:41,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361536125] [2019-11-28 14:44:41,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:44:41,747 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 14:44:41,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:44:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 14:44:42,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:44:42,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-28 14:44:42,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355195814] [2019-11-28 14:44:42,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 14:44:42,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 14:44:42,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 14:44:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-28 14:44:42,117 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-28 14:44:44,304 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-11-28 14:44:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:44:44,363 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-28 14:44:44,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 14:44:44,364 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-28 14:44:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:44:44,365 INFO L225 Difference]: With dead ends: 66 [2019-11-28 14:44:44,365 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 14:44:44,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 14:44:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 14:44:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 14:44:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 14:44:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 14:44:44,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-28 14:44:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:44:44,367 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 14:44:44,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 14:44:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 14:44:44,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 14:44:44,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 14:44:44,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:44:44 BoogieIcfgContainer [2019-11-28 14:44:44,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 14:44:44,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 14:44:44,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 14:44:44,576 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 14:44:44,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:44:22" (3/4) ... [2019-11-28 14:44:44,580 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 14:44:44,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 14:44:44,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 14:44:44,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-28 14:44:44,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-28 14:44:44,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 14:44:44,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 14:44:44,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 14:44:44,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 14:44:44,595 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 14:44:44,643 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 14:44:44,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 14:44:44,645 INFO L168 Benchmark]: Toolchain (without parser) took 23212.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -369.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:44:44,645 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:44:44,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 14:44:44,646 INFO L168 Benchmark]: Boogie Preprocessor took 36.70 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 14:44:44,647 INFO L168 Benchmark]: RCFGBuilder took 394.36 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-11-28 14:44:44,648 INFO L168 Benchmark]: TraceAbstraction took 22355.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 238.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -262.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:44:44,648 INFO L168 Benchmark]: Witness Printer took 67.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-11-28 14:44:44,651 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.70 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 394.36 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22355.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 238.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -262.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 67.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free 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: 36]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 12 error locations. Result: SAFE, OverallTime: 22.3s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1965 SDslu, 712 SDs, 0 SdLazy, 4878 SolverSat, 989 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 247 SyntacticMatches, 11 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 32 QuantifiedInterpolants, 129907 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1012 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 49/110 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...