./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 3d056a1f 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.24-3d056a1 [2019-11-22 14:29:39,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:29:39,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:29:39,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:29:39,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:29:39,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:29:39,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:29:39,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:29:39,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:29:39,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:29:39,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:29:39,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:29:39,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:29:39,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:29:39,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:29:39,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:29:39,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:29:39,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:29:39,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:29:39,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:29:39,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:29:39,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:29:39,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:29:39,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:29:39,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:29:39,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:29:39,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:29:39,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:29:39,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:29:39,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:29:39,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:29:39,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:29:39,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:29:39,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:29:39,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:29:39,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:29:39,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:29:39,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:29:39,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:29:39,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:29:39,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:29:39,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-22 14:29:39,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:29:39,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:29:39,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:29:39,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:29:39,897 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:29:39,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:29:39,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:29:39,897 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:29:39,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:29:39,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:29:39,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:29:39,900 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:29:39,900 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:29:39,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 14:29:39,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:29:39,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:29:39,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:29:39,902 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:29:39,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:29:39,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:29:39,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:29:39,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:29:39,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:29:39,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:29:39,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:29:39,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:29:39,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:29:39,905 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-22 14:29:40,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:29:40,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:29:40,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:29:40,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:29:40,241 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:29:40,242 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-22 14:29:40,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786856664/67115a44aa0f484287ab6546450e066f/FLAG06df7b810 [2019-11-22 14:29:40,759 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:29:40,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-22 14:29:40,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786856664/67115a44aa0f484287ab6546450e066f/FLAG06df7b810 [2019-11-22 14:29:41,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786856664/67115a44aa0f484287ab6546450e066f [2019-11-22 14:29:41,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:29:41,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:29:41,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:29:41,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:29:41,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:29:41,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fc2faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41, skipping insertion in model container [2019-11-22 14:29:41,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:29:41,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:29:41,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:29:41,429 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:29:41,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:29:41,571 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:29:41,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41 WrapperNode [2019-11-22 14:29:41,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:29:41,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:29:41,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:29:41,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:29:41,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (1/1) ... [2019-11-22 14:29:41,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:29:41,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:29:41,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:29:41,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:29:41,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (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-22 14:29:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:29:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:29:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 14:29:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 14:29:41,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:29:41,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 14:29:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:29:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:29:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:29:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 14:29:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 14:29:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:29:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 14:29:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 14:29:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:29:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:29:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 14:29:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:29:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:29:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:29:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:29:42,100 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:29:42,100 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-22 14:29:42,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:42 BoogieIcfgContainer [2019-11-22 14:29:42,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:29:42,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:29:42,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:29:42,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:29:42,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:29:41" (1/3) ... [2019-11-22 14:29:42,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c42f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:29:42, skipping insertion in model container [2019-11-22 14:29:42,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:41" (2/3) ... [2019-11-22 14:29:42,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c42f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:29:42, skipping insertion in model container [2019-11-22 14:29:42,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:42" (3/3) ... [2019-11-22 14:29:42,109 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-11-22 14:29:42,118 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:29:42,127 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-22 14:29:42,138 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-22 14:29:42,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:29:42,157 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:29:42,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:29:42,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:29:42,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:29:42,158 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:29:42,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:29:42,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:29:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-22 14:29:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 14:29:42,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:42,186 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-22 14:29:42,186 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-22 14:29:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-11-22 14:29:42,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:42,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216169009] [2019-11-22 14:29:42,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:29:42,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216169009] [2019-11-22 14:29:42,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:42,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:29:42,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414277957] [2019-11-22 14:29:42,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:29:42,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:29:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:29:42,532 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-22 14:29:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:42,863 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-22 14:29:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:29:42,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-22 14:29:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:42,875 INFO L225 Difference]: With dead ends: 52 [2019-11-22 14:29:42,875 INFO L226 Difference]: Without dead ends: 49 [2019-11-22 14:29:42,877 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-22 14:29:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-22 14:29:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-22 14:29:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-22 14:29:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-22 14:29:42,923 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-11-22 14:29:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:42,925 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-22 14:29:42,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:29:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-22 14:29:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:29:42,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:42,928 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-22 14:29:42,930 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-22 14:29:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:42,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-11-22 14:29:42,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:42,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392309356] [2019-11-22 14:29:42,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,118 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-22 14:29:43,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392309356] [2019-11-22 14:29:43,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:43,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:29:43,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344664465] [2019-11-22 14:29:43,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:29:43,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:29:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:29:43,126 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-22 14:29:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:43,357 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-22 14:29:43,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:29:43,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-22 14:29:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:43,360 INFO L225 Difference]: With dead ends: 48 [2019-11-22 14:29:43,360 INFO L226 Difference]: Without dead ends: 48 [2019-11-22 14:29:43,361 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-22 14:29:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-22 14:29:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-22 14:29:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-22 14:29:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-22 14:29:43,369 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-11-22 14:29:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:43,370 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-22 14:29:43,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:29:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-22 14:29:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:29:43,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:43,371 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-22 14:29:43,372 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-22 14:29:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-11-22 14:29:43,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:43,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169798260] [2019-11-22 14:29:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,498 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-22 14:29:43,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169798260] [2019-11-22 14:29:43,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:43,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:29:43,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446307032] [2019-11-22 14:29:43,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:29:43,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:29:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:29:43,501 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-11-22 14:29:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:43,730 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-22 14:29:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:29:43,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-22 14:29:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:43,733 INFO L225 Difference]: With dead ends: 47 [2019-11-22 14:29:43,733 INFO L226 Difference]: Without dead ends: 47 [2019-11-22 14:29:43,734 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-22 14:29:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-22 14:29:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-22 14:29:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-22 14:29:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-22 14:29:43,746 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-22 14:29:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:43,746 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-22 14:29:43,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:29:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-22 14:29:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:29:43,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:43,751 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-22 14:29:43,751 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-22 14:29:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:43,752 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-11-22 14:29:43,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:43,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265510053] [2019-11-22 14:29:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:43,897 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-22 14:29:43,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265510053] [2019-11-22 14:29:43,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:43,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:29:43,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43901911] [2019-11-22 14:29:43,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:29:43,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:29:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:29:43,901 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-11-22 14:29:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:44,248 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-22 14:29:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 14:29:44,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 14:29:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:44,250 INFO L225 Difference]: With dead ends: 43 [2019-11-22 14:29:44,251 INFO L226 Difference]: Without dead ends: 43 [2019-11-22 14:29:44,252 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-22 14:29:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-22 14:29:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-22 14:29:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-22 14:29:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-22 14:29:44,258 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-11-22 14:29:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:44,258 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-22 14:29:44,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:29:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-22 14:29:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:29:44,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:44,259 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-22 14:29:44,260 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-22 14:29:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-11-22 14:29:44,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:44,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87507426] [2019-11-22 14:29:44,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:44,399 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-22 14:29:44,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87507426] [2019-11-22 14:29:44,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:44,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:29:44,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806706645] [2019-11-22 14:29:44,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 14:29:44,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 14:29:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:29:44,402 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-11-22 14:29:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:44,995 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-22 14:29:44,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:29:44,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-22 14:29:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:44,999 INFO L225 Difference]: With dead ends: 77 [2019-11-22 14:29:44,999 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 14:29:45,000 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-22 14:29:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 14:29:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-22 14:29:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 14:29:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-22 14:29:45,011 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-11-22 14:29:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:45,011 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-22 14:29:45,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 14:29:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-22 14:29:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:29:45,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:45,013 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-22 14:29:45,013 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-22 14:29:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-11-22 14:29:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:45,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783013692] [2019-11-22 14:29:45,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,101 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-22 14:29:45,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783013692] [2019-11-22 14:29:45,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:45,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:29:45,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860798943] [2019-11-22 14:29:45,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:29:45,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:29:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:29:45,104 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-11-22 14:29:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:45,285 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-22 14:29:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:29:45,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:29:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:45,287 INFO L225 Difference]: With dead ends: 60 [2019-11-22 14:29:45,287 INFO L226 Difference]: Without dead ends: 55 [2019-11-22 14:29:45,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 14:29:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-22 14:29:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-22 14:29:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 14:29:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-22 14:29:45,294 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-22 14:29:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:45,295 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-22 14:29:45,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:29:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-22 14:29:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 14:29:45,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:45,296 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-22 14:29:45,297 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-22 14:29:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-11-22 14:29:45,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:45,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794101032] [2019-11-22 14:29:45,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:45,513 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-22 14:29:45,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794101032] [2019-11-22 14:29:45,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:29:45,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 14:29:45,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555984271] [2019-11-22 14:29:45,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:29:45,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:45,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:29:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:29:45,517 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-11-22 14:29:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:46,104 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-22 14:29:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:29:46,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 14:29:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:46,105 INFO L225 Difference]: With dead ends: 68 [2019-11-22 14:29:46,105 INFO L226 Difference]: Without dead ends: 68 [2019-11-22 14:29:46,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-22 14:29:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-22 14:29:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-11-22 14:29:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 14:29:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-22 14:29:46,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-11-22 14:29:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:46,125 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-22 14:29:46,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:29:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-22 14:29:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:29:46,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:46,126 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-22 14:29:46,127 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-22 14:29:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:46,127 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-11-22 14:29:46,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:46,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882752262] [2019-11-22 14:29:46,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:46,320 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-22 14:29:46,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882752262] [2019-11-22 14:29:46,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366373212] [2019-11-22 14:29:46,320 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-22 14:29:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:46,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 14:29:46,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:46,584 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-22 14:29:46,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:46,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-22 14:29:46,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186916603] [2019-11-22 14:29:46,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 14:29:46,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:46,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 14:29:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-22 14:29:46,587 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-11-22 14:29:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:47,688 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-11-22 14:29:47,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-22 14:29:47,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-22 14:29:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:47,690 INFO L225 Difference]: With dead ends: 80 [2019-11-22 14:29:47,690 INFO L226 Difference]: Without dead ends: 80 [2019-11-22 14:29:47,692 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-22 14:29:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-22 14:29:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-22 14:29:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 14:29:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-22 14:29:47,700 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-11-22 14:29:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:47,700 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-22 14:29:47,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 14:29:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-22 14:29:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 14:29:47,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:47,702 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-22 14:29:47,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:47,907 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-22 14:29:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:47,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-11-22 14:29:47,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:47,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719789799] [2019-11-22 14:29:47,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:48,142 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-22 14:29:48,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719789799] [2019-11-22 14:29:48,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852502595] [2019-11-22 14:29:48,143 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-22 14:29:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:48,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 14:29:48,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:48,607 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-22 14:29:48,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:48,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-22 14:29:48,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774653814] [2019-11-22 14:29:48,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 14:29:48,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 14:29:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-22 14:29:48,610 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-11-22 14:29:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:53,304 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-22 14:29:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-22 14:29:53,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-22 14:29:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:53,306 INFO L225 Difference]: With dead ends: 110 [2019-11-22 14:29:53,307 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 14:29:53,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2019-11-22 14:29:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 14:29:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-11-22 14:29:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-22 14:29:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-22 14:29:53,319 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-11-22 14:29:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:53,319 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-22 14:29:53,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 14:29:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-22 14:29:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 14:29:53,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:53,321 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-22 14:29:53,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:53,525 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-22 14:29:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-11-22 14:29:53,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:53,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4211365] [2019-11-22 14:29:53,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:53,706 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-22 14:29:53,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4211365] [2019-11-22 14:29:53,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970145951] [2019-11-22 14:29:53,707 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-22 14:29:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:53,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:29:53,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:53,806 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-22 14:29:53,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:53,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:53,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:53,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:29:54,201 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-22 14:29:54,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:54,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 14:29:54,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54175445] [2019-11-22 14:29:54,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 14:29:54,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:54,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 14:29:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:29:54,204 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-11-22 14:29:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:55,958 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-11-22 14:29:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 14:29:55,963 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-22 14:29:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:55,965 INFO L225 Difference]: With dead ends: 115 [2019-11-22 14:29:55,965 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 14:29:55,966 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-22 14:29:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 14:29:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-11-22 14:29:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-22 14:29:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-22 14:29:55,975 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-11-22 14:29:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:55,975 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-22 14:29:55,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 14:29:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-22 14:29:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 14:29:55,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:55,977 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-22 14:29:56,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:56,180 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-22 14:29:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-11-22 14:29:56,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:56,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191727184] [2019-11-22 14:29:56,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:56,401 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-22 14:29:56,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191727184] [2019-11-22 14:29:56,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266078903] [2019-11-22 14:29:56,402 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-22 14:29:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:56,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 14:29:56,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:56,480 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-22 14:29:56,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:56,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:56,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:56,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-22 14:29:58,658 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-22 14:29:58,745 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-22 14:29:58,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:58,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:58,750 INFO L496 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-22 14:29:58,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-22 14:29:58,778 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-22 14:29:58,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 14:29:58,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-22 14:29:58,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422443417] [2019-11-22 14:29:58,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 14:29:58,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 14:29:58,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-22 14:29:58,780 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-11-22 14:29:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:29:58,914 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-22 14:29:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 14:29:58,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-22 14:29:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:29:58,915 INFO L225 Difference]: With dead ends: 83 [2019-11-22 14:29:58,915 INFO L226 Difference]: Without dead ends: 63 [2019-11-22 14:29:58,916 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-22 14:29:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-22 14:29:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-22 14:29:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 14:29:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-22 14:29:58,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-11-22 14:29:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:29:58,920 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-22 14:29:58,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 14:29:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-22 14:29:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 14:29:58,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:29:58,921 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-22 14:29:59,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:29:59,125 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-22 14:29:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:29:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-11-22 14:29:59,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:29:59,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544799298] [2019-11-22 14:29:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:29:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:59,271 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-22 14:29:59,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544799298] [2019-11-22 14:29:59,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936523749] [2019-11-22 14:29:59,272 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-22 14:29:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:29:59,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:29:59,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:29:59,338 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-22 14:29:59,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:29:59,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:29:59,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:29:59,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 14:29:59,672 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-22 14:29:59,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:29:59,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 14:29:59,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903001355] [2019-11-22 14:29:59,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 14:29:59,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:29:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 14:29:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 14:29:59,675 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-11-22 14:30:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:00,865 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-22 14:30:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-22 14:30:00,866 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-22 14:30:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:00,867 INFO L225 Difference]: With dead ends: 63 [2019-11-22 14:30:00,867 INFO L226 Difference]: Without dead ends: 63 [2019-11-22 14:30:00,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-11-22 14:30:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-22 14:30:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-22 14:30:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 14:30:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-22 14:30:00,871 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-11-22 14:30:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:00,872 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-22 14:30:00,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 14:30:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-22 14:30:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 14:30:00,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:00,874 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-22 14:30:01,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:01,075 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-22 14:30:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-11-22 14:30:01,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:01,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223877115] [2019-11-22 14:30:01,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,433 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-22 14:30:01,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223877115] [2019-11-22 14:30:01,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087191365] [2019-11-22 14:30:01,434 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-22 14:30:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:01,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-22 14:30:01,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:01,866 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-22 14:30:01,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:01,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-22 14:30:01,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999199552] [2019-11-22 14:30:01,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 14:30:01,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 14:30:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:30:01,868 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-22 14:30:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:04,078 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 14:30:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 14:30:04,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-22 14:30:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:04,080 INFO L225 Difference]: With dead ends: 66 [2019-11-22 14:30:04,080 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:30:04,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 14:30:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:30:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:30:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:30:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:30:04,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-22 14:30:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:04,082 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:30:04,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 14:30:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:30:04,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:30:04,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:04,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:30:04 BoogieIcfgContainer [2019-11-22 14:30:04,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:30:04,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:30:04,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:30:04,293 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:30:04,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:42" (3/4) ... [2019-11-22 14:30:04,296 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:30:04,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:30:04,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:30:04,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 14:30:04,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 14:30:04,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 14:30:04,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-22 14:30:04,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 14:30:04,314 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 14:30:04,314 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:30:04,366 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:30:04,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:30:04,368 INFO L168 Benchmark]: Toolchain (without parser) took 23224.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 961.7 MB in the beginning and 765.0 MB in the end (delta: 196.7 MB). Peak memory consumption was 487.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:04,369 INFO L168 Benchmark]: CDTParser took 0.56 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-22 14:30:04,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -119.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:04,370 INFO L168 Benchmark]: Boogie Preprocessor took 64.03 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:04,371 INFO L168 Benchmark]: RCFGBuilder took 464.30 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:04,371 INFO L168 Benchmark]: TraceAbstraction took 22189.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 765.0 MB in the end (delta: 287.5 MB). Peak memory consumption was 492.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:04,372 INFO L168 Benchmark]: Witness Printer took 74.28 ms. Allocated memory is still 1.3 GB. Free memory is still 765.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:30:04,375 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.56 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 427.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -119.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.03 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 464.30 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22189.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 765.0 MB in the end (delta: 287.5 MB). Peak memory consumption was 492.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.28 ms. Allocated memory is still 1.3 GB. Free memory is still 765.0 MB. There was no memory consumed. 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.1s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.6s, 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.6s 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.1s 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...