./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc 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_onepoint.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 f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:57:34,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:57:34,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:57:34,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:57:34,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:57:34,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:57:34,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:57:34,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:57:34,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:57:34,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:57:34,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:57:34,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:57:34,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:57:34,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:57:34,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:57:34,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:57:34,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:57:34,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:57:34,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:57:34,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:57:34,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:57:34,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:57:34,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:57:34,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:57:34,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:57:34,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:57:34,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:57:34,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:57:34,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:57:34,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:57:34,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:57:34,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:57:34,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:57:34,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:57:34,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:57:34,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:57:34,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:57:34,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:57:34,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:57:34,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:57:34,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:57:34,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 17:57:34,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:57:34,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:57:34,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:57:34,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:57:34,140 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:57:34,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:57:34,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:57:34,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:57:34,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:57:34,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:57:34,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:57:34,142 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:57:34,143 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:57:34,143 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:57:34,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:57:34,144 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:57:34,144 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:57:34,144 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:57:34,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:57:34,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:57:34,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:57:34,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:57:34,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:57:34,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:57:34,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:57:34,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:57:34,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:57:34,146 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 -> f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 [2019-11-25 17:57:34,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:57:34,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:57:34,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:57:34,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:57:34,480 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:57:34,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-25 17:57:34,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d24ff401/7d6a45588bae4093b4fc8aaa003bf57b/FLAG4bc84cf6e [2019-11-25 17:57:34,968 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:57:34,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-25 17:57:34,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d24ff401/7d6a45588bae4093b4fc8aaa003bf57b/FLAG4bc84cf6e [2019-11-25 17:57:35,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d24ff401/7d6a45588bae4093b4fc8aaa003bf57b [2019-11-25 17:57:35,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:57:35,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:57:35,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:57:35,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:57:35,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:57:35,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b09392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35, skipping insertion in model container [2019-11-25 17:57:35,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:57:35,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:57:35,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:57:35,620 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:57:35,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:57:35,714 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:57:35,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35 WrapperNode [2019-11-25 17:57:35,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:57:35,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:57:35,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:57:35,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:57:35,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (1/1) ... [2019-11-25 17:57:35,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:57:35,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:57:35,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:57:35,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:57:35,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (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-25 17:57:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:57:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:57:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:57:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-25 17:57:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:57:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:57:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:57:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:57:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:57:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:57:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:57:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:57:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-25 17:57:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:57:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:57:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:57:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:57:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:57:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:57:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:57:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:57:36,197 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:57:36,198 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-25 17:57:36,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:57:36 BoogieIcfgContainer [2019-11-25 17:57:36,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:57:36,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:57:36,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:57:36,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:57:36,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:57:35" (1/3) ... [2019-11-25 17:57:36,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbe1f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:57:36, skipping insertion in model container [2019-11-25 17:57:36,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:35" (2/3) ... [2019-11-25 17:57:36,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbe1f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:57:36, skipping insertion in model container [2019-11-25 17:57:36,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:57:36" (3/3) ... [2019-11-25 17:57:36,208 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2019-11-25 17:57:36,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:57:36,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 17:57:36,235 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 17:57:36,256 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:57:36,257 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:57:36,257 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:57:36,257 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:57:36,257 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:57:36,257 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:57:36,258 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:57:36,258 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:57:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-25 17:57:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:57:36,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:36,285 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-25 17:57:36,285 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957205, now seen corresponding path program 1 times [2019-11-25 17:57:36,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:36,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014917196] [2019-11-25 17:57:36,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:36,612 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-25 17:57:36,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014917196] [2019-11-25 17:57:36,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:36,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:57:36,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956138534] [2019-11-25 17:57:36,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:57:36,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:57:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:57:36,642 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2019-11-25 17:57:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:37,002 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-25 17:57:37,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:57:37,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-25 17:57:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:37,015 INFO L225 Difference]: With dead ends: 59 [2019-11-25 17:57:37,015 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 17:57:37,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:57:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 17:57:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-25 17:57:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 17:57:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-25 17:57:37,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 18 [2019-11-25 17:57:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:37,059 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-25 17:57:37,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:57:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-25 17:57:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:57:37,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:37,062 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-25 17:57:37,062 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:37,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:37,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957204, now seen corresponding path program 1 times [2019-11-25 17:57:37,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:37,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488587609] [2019-11-25 17:57:37,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,254 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-25 17:57:37,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488587609] [2019-11-25 17:57:37,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:37,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:57:37,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674266799] [2019-11-25 17:57:37,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:57:37,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:57:37,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:57:37,259 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2019-11-25 17:57:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:37,584 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-25 17:57:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:57:37,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-25 17:57:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:37,586 INFO L225 Difference]: With dead ends: 54 [2019-11-25 17:57:37,587 INFO L226 Difference]: Without dead ends: 54 [2019-11-25 17:57:37,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:57:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-25 17:57:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-25 17:57:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 17:57:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-25 17:57:37,597 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2019-11-25 17:57:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:37,597 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-25 17:57:37,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:57:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-25 17:57:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 17:57:37,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:37,599 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-25 17:57:37,599 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2036436141, now seen corresponding path program 1 times [2019-11-25 17:57:37,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:37,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342870644] [2019-11-25 17:57:37,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:37,873 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-25 17:57:37,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342870644] [2019-11-25 17:57:37,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:37,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 17:57:37,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686303540] [2019-11-25 17:57:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:57:37,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:57:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:57:37,877 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-11-25 17:57:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:38,460 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-25 17:57:38,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:57:38,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-25 17:57:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:38,465 INFO L225 Difference]: With dead ends: 82 [2019-11-25 17:57:38,465 INFO L226 Difference]: Without dead ends: 82 [2019-11-25 17:57:38,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:57:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-25 17:57:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-25 17:57:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:57:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-25 17:57:38,492 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 20 [2019-11-25 17:57:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:38,493 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-25 17:57:38,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:57:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-25 17:57:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:57:38,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:38,494 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-25 17:57:38,495 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818779, now seen corresponding path program 1 times [2019-11-25 17:57:38,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:38,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349151793] [2019-11-25 17:57:38,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:38,642 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-25 17:57:38,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349151793] [2019-11-25 17:57:38,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:38,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:57:38,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114061553] [2019-11-25 17:57:38,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:57:38,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:38,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:57:38,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:57:38,645 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2019-11-25 17:57:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:38,930 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-25 17:57:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:57:38,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 17:57:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:38,932 INFO L225 Difference]: With dead ends: 56 [2019-11-25 17:57:38,932 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 17:57:38,933 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-25 17:57:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 17:57:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-25 17:57:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 17:57:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-11-25 17:57:38,940 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 21 [2019-11-25 17:57:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:38,941 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-25 17:57:38,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:57:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-11-25 17:57:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:57:38,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:38,942 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-25 17:57:38,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818778, now seen corresponding path program 1 times [2019-11-25 17:57:38,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:38,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917108831] [2019-11-25 17:57:38,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:39,177 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-25 17:57:39,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917108831] [2019-11-25 17:57:39,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:39,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:57:39,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652802935] [2019-11-25 17:57:39,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:57:39,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:39,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:57:39,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:57:39,182 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-11-25 17:57:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:39,869 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-25 17:57:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:57:39,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-25 17:57:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:39,871 INFO L225 Difference]: With dead ends: 90 [2019-11-25 17:57:39,871 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 17:57:39,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:57:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 17:57:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2019-11-25 17:57:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 17:57:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-25 17:57:39,881 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 21 [2019-11-25 17:57:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:39,882 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-25 17:57:39,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:57:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-25 17:57:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:57:39,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:39,883 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-25 17:57:39,883 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:39,884 INFO L82 PathProgramCache]: Analyzing trace with hash -486807298, now seen corresponding path program 1 times [2019-11-25 17:57:39,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:39,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385287725] [2019-11-25 17:57:39,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,021 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-25 17:57:40,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385287725] [2019-11-25 17:57:40,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:40,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:57:40,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344607710] [2019-11-25 17:57:40,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:57:40,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:57:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:57:40,023 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 10 states. [2019-11-25 17:57:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:40,634 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-25 17:57:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:57:40,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-25 17:57:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:40,636 INFO L225 Difference]: With dead ends: 87 [2019-11-25 17:57:40,636 INFO L226 Difference]: Without dead ends: 87 [2019-11-25 17:57:40,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:57:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-25 17:57:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2019-11-25 17:57:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 17:57:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-25 17:57:40,644 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 22 [2019-11-25 17:57:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:40,645 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-25 17:57:40,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:57:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-25 17:57:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 17:57:40,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:40,646 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, 1, 1, 1, 1, 1, 1] [2019-11-25 17:57:40,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1532204726, now seen corresponding path program 1 times [2019-11-25 17:57:40,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:40,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946427261] [2019-11-25 17:57:40,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:40,720 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-25 17:57:40,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946427261] [2019-11-25 17:57:40,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:40,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:57:40,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795297827] [2019-11-25 17:57:40,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:57:40,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:57:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:57:40,723 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2019-11-25 17:57:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:40,889 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-11-25 17:57:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:57:40,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-25 17:57:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:40,891 INFO L225 Difference]: With dead ends: 73 [2019-11-25 17:57:40,892 INFO L226 Difference]: Without dead ends: 73 [2019-11-25 17:57:40,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-25 17:57:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-25 17:57:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-25 17:57:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 17:57:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-11-25 17:57:40,900 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 28 [2019-11-25 17:57:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:40,900 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-11-25 17:57:40,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:57:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-11-25 17:57:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:57:40,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:40,902 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-25 17:57:40,902 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1010784573, now seen corresponding path program 1 times [2019-11-25 17:57:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:40,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138753825] [2019-11-25 17:57:40,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:41,050 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-25 17:57:41,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138753825] [2019-11-25 17:57:41,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997233938] [2019-11-25 17:57:41,051 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-25 17:57:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:41,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:57:41,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:57:41,405 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-25 17:57:41,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:57:41,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-25 17:57:41,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436775934] [2019-11-25 17:57:41,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 17:57:41,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:41,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 17:57:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:57:41,408 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 17 states. [2019-11-25 17:57:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:49,196 INFO L93 Difference]: Finished difference Result 139 states and 166 transitions. [2019-11-25 17:57:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 17:57:49,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-25 17:57:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:49,198 INFO L225 Difference]: With dead ends: 139 [2019-11-25 17:57:49,199 INFO L226 Difference]: Without dead ends: 139 [2019-11-25 17:57:49,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2019-11-25 17:57:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-25 17:57:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2019-11-25 17:57:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-25 17:57:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2019-11-25 17:57:49,221 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 30 [2019-11-25 17:57:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:49,221 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2019-11-25 17:57:49,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 17:57:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2019-11-25 17:57:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:57:49,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:49,223 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:57:49,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:57:49,428 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:49,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash -725039271, now seen corresponding path program 1 times [2019-11-25 17:57:49,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:49,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014809801] [2019-11-25 17:57:49,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,537 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-25 17:57:49,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014809801] [2019-11-25 17:57:49,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:57:49,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:57:49,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679377848] [2019-11-25 17:57:49,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:57:49,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:49,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:57:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:57:49,540 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand 7 states. [2019-11-25 17:57:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:49,726 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2019-11-25 17:57:49,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:57:49,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-25 17:57:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:49,732 INFO L225 Difference]: With dead ends: 112 [2019-11-25 17:57:49,732 INFO L226 Difference]: Without dead ends: 100 [2019-11-25 17:57:49,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 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-25 17:57:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-25 17:57:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-25 17:57:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-25 17:57:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2019-11-25 17:57:49,741 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 30 [2019-11-25 17:57:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:49,742 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2019-11-25 17:57:49,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:57:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2019-11-25 17:57:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:57:49,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:49,743 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-25 17:57:49,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -701366204, now seen corresponding path program 1 times [2019-11-25 17:57:49,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:49,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248285785] [2019-11-25 17:57:49,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:50,002 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-25 17:57:50,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248285785] [2019-11-25 17:57:50,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512099187] [2019-11-25 17:57:50,003 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-25 17:57:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:50,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 17:57:50,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:57:50,409 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-25 17:57:50,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:57:50,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-25 17:57:50,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131474014] [2019-11-25 17:57:50,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-25 17:57:50,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:50,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-25 17:57:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:57:50,415 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand 27 states. [2019-11-25 17:57:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:53,265 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-11-25 17:57:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-25 17:57:53,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-25 17:57:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:53,271 INFO L225 Difference]: With dead ends: 187 [2019-11-25 17:57:53,271 INFO L226 Difference]: Without dead ends: 187 [2019-11-25 17:57:53,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=475, Invalid=2495, Unknown=0, NotChecked=0, Total=2970 [2019-11-25 17:57:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-25 17:57:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-11-25 17:57:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-25 17:57:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-11-25 17:57:53,303 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 32 [2019-11-25 17:57:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:53,304 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-25 17:57:53,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-25 17:57:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-11-25 17:57:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:57:53,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:53,306 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-25 17:57:53,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:57:53,507 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash -997384011, now seen corresponding path program 1 times [2019-11-25 17:57:53,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:53,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432942803] [2019-11-25 17:57:53,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:53,729 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-25 17:57:53,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432942803] [2019-11-25 17:57:53,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273304461] [2019-11-25 17:57:53,730 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-25 17:57:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:53,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:57:53,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:57:53,856 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-25 17:57:53,858 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:57:53,871 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:57:53,872 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:57:53,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:57:54,282 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-25 17:57:54,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:57:54,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-25 17:57:54,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583238988] [2019-11-25 17:57:54,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 17:57:54,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:54,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 17:57:54,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:57:54,285 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 21 states. [2019-11-25 17:57:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:56,234 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2019-11-25 17:57:56,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 17:57:56,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-25 17:57:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:56,238 INFO L225 Difference]: With dead ends: 210 [2019-11-25 17:57:56,238 INFO L226 Difference]: Without dead ends: 210 [2019-11-25 17:57:56,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2019-11-25 17:57:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-25 17:57:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2019-11-25 17:57:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 17:57:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2019-11-25 17:57:56,250 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 33 [2019-11-25 17:57:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:56,250 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2019-11-25 17:57:56,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 17:57:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2019-11-25 17:57:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:57:56,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:56,252 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-25 17:57:56,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:57:56,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1094393214, now seen corresponding path program 1 times [2019-11-25 17:57:56,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547582427] [2019-11-25 17:57:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:56,674 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-25 17:57:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547582427] [2019-11-25 17:57:56,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064170019] [2019-11-25 17:57:56,675 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-25 17:57:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:56,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:57:56,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:57:56,767 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-25 17:57:56,768 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:57:56,774 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:57:56,774 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:57:56,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-25 17:57:58,959 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-25 17:57:59,044 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-25 17:57:59,044 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:57:59,048 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:57:59,049 INFO L508 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-25 17:57:59,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-25 17:57:59,086 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-25 17:57:59,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:57:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-25 17:57:59,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20463512] [2019-11-25 17:57:59,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:57:59,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:57:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:57:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-25 17:57:59,088 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 10 states. [2019-11-25 17:57:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:57:59,273 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-25 17:57:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:57:59,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-25 17:57:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:57:59,275 INFO L225 Difference]: With dead ends: 85 [2019-11-25 17:57:59,275 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 17:57:59,275 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-25 17:57:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 17:57:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-25 17:57:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-25 17:57:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-25 17:57:59,287 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 32 [2019-11-25 17:57:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:57:59,288 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-25 17:57:59,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:57:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-25 17:57:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:57:59,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:57:59,289 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-25 17:57:59,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:57:59,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:57:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:57:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -854133297, now seen corresponding path program 1 times [2019-11-25 17:57:59,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:57:59,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259398772] [2019-11-25 17:57:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:57:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:59,639 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-25 17:57:59,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259398772] [2019-11-25 17:57:59,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978801534] [2019-11-25 17:57:59,640 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-25 17:57:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:57:59,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:57:59,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:57:59,710 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-25 17:57:59,711 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:57:59,724 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:57:59,725 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:57:59,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:00,118 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-25 17:58:00,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:00,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-25 17:58:00,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735740571] [2019-11-25 17:58:00,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 17:58:00,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:00,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 17:58:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:58:00,120 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2019-11-25 17:58:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:01,523 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-11-25 17:58:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:58:01,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-25 17:58:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:01,525 INFO L225 Difference]: With dead ends: 93 [2019-11-25 17:58:01,526 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 17:58:01,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 17:58:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 17:58:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-25 17:58:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-25 17:58:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-25 17:58:01,533 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2019-11-25 17:58:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:01,533 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-25 17:58:01,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 17:58:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-25 17:58:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 17:58:01,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:01,535 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-25 17:58:01,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:01,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1410938279, now seen corresponding path program 1 times [2019-11-25 17:58:01,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:01,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701981133] [2019-11-25 17:58:01,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:58:02,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701981133] [2019-11-25 17:58:02,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988503788] [2019-11-25 17:58:02,198 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-25 17:58:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-25 17:58:02,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:02,270 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-25 17:58:02,270 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:02,278 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:02,278 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:02,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:58:02,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:02,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2019-11-25 17:58:02,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381673743] [2019-11-25 17:58:02,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 17:58:02,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:02,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 17:58:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-11-25 17:58:02,841 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 32 states. [2019-11-25 17:58:04,409 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-25 17:58:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:05,155 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-25 17:58:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-25 17:58:05,155 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-11-25 17:58:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:05,156 INFO L225 Difference]: With dead ends: 91 [2019-11-25 17:58:05,156 INFO L226 Difference]: Without dead ends: 67 [2019-11-25 17:58:05,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2019-11-25 17:58:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-25 17:58:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-25 17:58:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:58:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-25 17:58:05,161 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 45 [2019-11-25 17:58:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:05,161 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-25 17:58:05,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 17:58:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-25 17:58:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 17:58:05,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:05,162 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-25 17:58:05,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:05,367 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1674201326, now seen corresponding path program 1 times [2019-11-25 17:58:05,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:05,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671620775] [2019-11-25 17:58:05,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,735 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-25 17:58:05,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671620775] [2019-11-25 17:58:05,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678723387] [2019-11-25 17:58:05,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:05,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-25 17:58:05,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:06,218 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-25 17:58:06,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:06,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-25 17:58:06,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058488594] [2019-11-25 17:58:06,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 17:58:06,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 17:58:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-25 17:58:06,220 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-25 17:58:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:08,390 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-25 17:58:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-25 17:58:08,391 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-25 17:58:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:08,391 INFO L225 Difference]: With dead ends: 66 [2019-11-25 17:58:08,391 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:58:08,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-25 17:58:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:58:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:58:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:58:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:58:08,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-25 17:58:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:08,395 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:58:08,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 17:58:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:58:08,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:58:08,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:08,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:08 BoogieIcfgContainer [2019-11-25 17:58:08,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:58:08,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:58:08,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:58:08,605 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:58:08,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:57:36" (3/4) ... [2019-11-25 17:58:08,608 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:58:08,615 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:58:08,615 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:58:08,616 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:58:08,616 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-25 17:58:08,616 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:58:08,622 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-25 17:58:08,622 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:58:08,623 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 17:58:08,623 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:58:08,678 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:58:08,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:58:08,683 INFO L168 Benchmark]: Toolchain (without parser) took 33318.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 401.1 MB). Free memory was 961.7 MB in the beginning and 995.8 MB in the end (delta: -34.1 MB). Peak memory consumption was 366.9 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:08,684 INFO L168 Benchmark]: CDTParser took 0.24 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-25 17:58:08,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:08,689 INFO L168 Benchmark]: Boogie Preprocessor took 39.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:08,690 INFO L168 Benchmark]: RCFGBuilder took 444.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:08,690 INFO L168 Benchmark]: TraceAbstraction took 32403.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 266.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.0 MB). Peak memory consumption was 357.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:08,691 INFO L168 Benchmark]: Witness Printer took 77.11 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 995.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:08,698 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.24 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 349.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 444.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32403.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 266.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.0 MB). Peak memory consumption was 357.3 MB. Max. memory is 11.5 GB. * Witness Printer took 77.11 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 995.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: 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: 21]: 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 16 error locations. Result: SAFE, OverallTime: 32.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 518 SDtfs, 2411 SDslu, 1129 SDs, 0 SdLazy, 6903 SolverSat, 1189 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 291 SyntacticMatches, 14 SemanticMatches, 367 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, 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, 15 MinimizatonAttempts, 220 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 682 ConstructedInterpolants, 68 QuantifiedInterpolants, 185721 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 59/126 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...