./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:26:23,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:26:23,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:26:23,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:26:23,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:26:23,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:26:23,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:26:23,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:26:24,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:26:24,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:26:24,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:26:24,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:26:24,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:26:24,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:26:24,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:26:24,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:26:24,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:26:24,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:26:24,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:26:24,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:26:24,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:26:24,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:26:24,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:26:24,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:26:24,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:26:24,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:26:24,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:26:24,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:26:24,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:26:24,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:26:24,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:26:24,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:26:24,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:26:24,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:26:24,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:26:24,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:26:24,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:26:24,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:26:24,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:26:24,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:26:24,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:26:24,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:26:24,065 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:26:24,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:26:24,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:26:24,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:26:24,068 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:26:24,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:26:24,068 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:26:24,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:26:24,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:26:24,069 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:26:24,069 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:26:24,070 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:26:24,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:26:24,070 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:26:24,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:26:24,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:26:24,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:26:24,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:26:24,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:26:24,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:26:24,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:26:24,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:26:24,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:26:24,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:26:24,073 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-11-25 17:26:24,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:26:24,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:26:24,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:26:24,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:26:24,373 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:26:24,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2019-11-25 17:26:24,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c25da19/f7faeeeb56b84a15bdb69a0398fbbfeb/FLAG32fc95f01 [2019-11-25 17:26:24,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:26:24,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2019-11-25 17:26:24,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c25da19/f7faeeeb56b84a15bdb69a0398fbbfeb/FLAG32fc95f01 [2019-11-25 17:26:25,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c25da19/f7faeeeb56b84a15bdb69a0398fbbfeb [2019-11-25 17:26:25,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:26:25,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:26:25,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:26:25,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:26:25,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:26:25,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5cec1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25, skipping insertion in model container [2019-11-25 17:26:25,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:26:25,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:26:25,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:26:25,615 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:26:25,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:26:25,714 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:26:25,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25 WrapperNode [2019-11-25 17:26:25,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:26:25,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:26:25,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:26:25,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:26:25,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,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:26:25" (1/1) ... [2019-11-25 17:26:25,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (1/1) ... [2019-11-25 17:26:25,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:26:25,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:26:25,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:26:25,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:26:25,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (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:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-11-25 17:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-25 17:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:26:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:26:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:26:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:26:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:26:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:26:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:26:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:26:26,264 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:26:26,264 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 17:26:26,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:26:26 BoogieIcfgContainer [2019-11-25 17:26:26,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:26:26,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:26:26,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:26:26,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:26:26,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:26:25" (1/3) ... [2019-11-25 17:26:26,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd5129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:26:26, skipping insertion in model container [2019-11-25 17:26:26,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:26:25" (2/3) ... [2019-11-25 17:26:26,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd5129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:26:26, skipping insertion in model container [2019-11-25 17:26:26,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:26:26" (3/3) ... [2019-11-25 17:26:26,274 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-11-25 17:26:26,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:26:26,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 17:26:26,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 17:26:26,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:26:26,323 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:26:26,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:26:26,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:26:26,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:26:26,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:26:26,324 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:26:26,324 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:26:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-25 17:26:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:26:26,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:26,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:26,354 INFO L410 AbstractCegarLoop]: === Iteration 1 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-11-25 17:26:26,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:26,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070085996] [2019-11-25 17:26:26,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,678 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:26:26,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070085996] [2019-11-25 17:26:26,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:26,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:26:26,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307052514] [2019-11-25 17:26:26,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:26,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:26,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:26,704 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-11-25 17:26:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:27,171 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-25 17:26:27,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:26:27,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-25 17:26:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:27,187 INFO L225 Difference]: With dead ends: 60 [2019-11-25 17:26:27,188 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 17:26:27,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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:26:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 17:26:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 17:26:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 17:26:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-25 17:26:27,237 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-11-25 17:26:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:27,238 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-25 17:26:27,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-25 17:26:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:26:27,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:27,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:27,240 INFO L410 AbstractCegarLoop]: === Iteration 2 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-11-25 17:26:27,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:27,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171413432] [2019-11-25 17:26:27,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:27,531 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:26:27,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171413432] [2019-11-25 17:26:27,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:27,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:26:27,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745926278] [2019-11-25 17:26:27,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:26:27,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:27,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:26:27,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:26:27,535 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-11-25 17:26:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:28,160 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-25 17:26:28,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:26:28,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-25 17:26:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:28,165 INFO L225 Difference]: With dead ends: 70 [2019-11-25 17:26:28,165 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 17:26:28,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:26:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 17:26:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-25 17:26:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 17:26:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-25 17:26:28,178 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-25 17:26:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:28,179 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-25 17:26:28,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:26:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-25 17:26:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:26:28,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:28,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:28,183 INFO L410 AbstractCegarLoop]: === Iteration 3 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-11-25 17:26:28,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:28,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350757409] [2019-11-25 17:26:28,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:28,422 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:26:28,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350757409] [2019-11-25 17:26:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:28,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:26:28,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787562935] [2019-11-25 17:26:28,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:26:28,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:26:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:26:28,425 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-11-25 17:26:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:29,009 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-25 17:26:29,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:26:29,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 17:26:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:29,012 INFO L225 Difference]: With dead ends: 69 [2019-11-25 17:26:29,012 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 17:26:29,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:26:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 17:26:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-25 17:26:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:26:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 17:26:29,021 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-11-25 17:26:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:29,021 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 17:26:29,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:26:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 17:26:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:26:29,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:29,023 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:29,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-11-25 17:26:29,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:29,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348268004] [2019-11-25 17:26:29,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,091 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:26:29,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348268004] [2019-11-25 17:26:29,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:29,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:26:29,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778342144] [2019-11-25 17:26:29,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:26:29,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:26:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:26:29,096 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-25 17:26:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:29,273 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-25 17:26:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:26:29,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 17:26:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:29,278 INFO L225 Difference]: With dead ends: 61 [2019-11-25 17:26:29,278 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 17:26:29,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:26:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 17:26:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-25 17:26:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 17:26:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-25 17:26:29,287 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-11-25 17:26:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:29,287 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-25 17:26:29,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:26:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-25 17:26:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:26:29,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:29,289 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:29,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-11-25 17:26:29,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:29,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180305057] [2019-11-25 17:26:29,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:29,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180305057] [2019-11-25 17:26:29,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598086425] [2019-11-25 17:26:29,621 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:26:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:29,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 17:26:29,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:29,793 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:26:29,794 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:29,800 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:29,802 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:29,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:29,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:29,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:30,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:30,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-25 17:26:30,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487751393] [2019-11-25 17:26:30,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 17:26:30,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 17:26:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:26:30,074 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-11-25 17:26:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:30,868 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-25 17:26:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:26:30,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-25 17:26:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:30,870 INFO L225 Difference]: With dead ends: 69 [2019-11-25 17:26:30,871 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 17:26:30,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-25 17:26:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 17:26:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-25 17:26:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:26:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 17:26:30,878 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-11-25 17:26:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:30,878 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 17:26:30,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 17:26:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 17:26:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:26:30,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:30,879 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] [2019-11-25 17:26:31,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:31,085 INFO L410 AbstractCegarLoop]: === Iteration 6 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-11-25 17:26:31,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:31,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504640600] [2019-11-25 17:26:31,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,204 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:26:31,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504640600] [2019-11-25 17:26:31,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:31,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:26:31,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278838897] [2019-11-25 17:26:31,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:26:31,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:26:31,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:31,206 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-11-25 17:26:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:31,533 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-25 17:26:31,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:26:31,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-25 17:26:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:31,536 INFO L225 Difference]: With dead ends: 69 [2019-11-25 17:26:31,536 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 17:26:31,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:26:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 17:26:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-25 17:26:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:26:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-25 17:26:31,544 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-11-25 17:26:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:31,544 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-25 17:26:31,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:26:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-25 17:26:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:26:31,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:31,546 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:31,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:31,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-11-25 17:26:31,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:31,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916070930] [2019-11-25 17:26:31,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:31,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916070930] [2019-11-25 17:26:31,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473663155] [2019-11-25 17:26:31,738 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:26:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:31,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 17:26:31,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:31,801 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:26:31,801 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:31,816 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:31,817 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:31,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:32,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:32,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-25 17:26:32,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917256967] [2019-11-25 17:26:32,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 17:26:32,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 17:26:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:26:32,064 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-11-25 17:26:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:32,941 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 17:26:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 17:26:32,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-25 17:26:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:32,943 INFO L225 Difference]: With dead ends: 64 [2019-11-25 17:26:32,943 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 17:26:32,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:26:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 17:26:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-25 17:26:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 17:26:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-25 17:26:32,950 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-11-25 17:26:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:32,950 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-25 17:26:32,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 17:26:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-25 17:26:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 17:26:32,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:32,951 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] [2019-11-25 17:26:33,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:33,155 INFO L410 AbstractCegarLoop]: === Iteration 8 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-11-25 17:26:33,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:33,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675354536] [2019-11-25 17:26:33,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 17:26:33,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675354536] [2019-11-25 17:26:33,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:33,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:26:33,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687185462] [2019-11-25 17:26:33,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:33,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:33,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:33,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:33,247 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-11-25 17:26:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:33,508 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-25 17:26:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:26:33,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-25 17:26:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:33,510 INFO L225 Difference]: With dead ends: 57 [2019-11-25 17:26:33,510 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 17:26:33,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:26:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 17:26:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 17:26:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 17:26:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-25 17:26:33,517 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-11-25 17:26:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:33,517 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-25 17:26:33,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-25 17:26:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 17:26:33,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:33,518 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] [2019-11-25 17:26:33,519 INFO L410 AbstractCegarLoop]: === Iteration 9 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-11-25 17:26:33,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:33,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502712203] [2019-11-25 17:26:33,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:33,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502712203] [2019-11-25 17:26:33,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340534735] [2019-11-25 17:26:33,790 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:26:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:33,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:26:33,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:33,851 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:26:33,852 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:33,857 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:33,857 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:33,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:33,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:33,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:36,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:36,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-25 17:26:36,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304924953] [2019-11-25 17:26:36,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-25 17:26:36,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-25 17:26:36,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-25 17:26:36,345 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-11-25 17:26:39,461 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-25 17:26:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:41,892 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-25 17:26:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:26:41,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-25 17:26:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:41,894 INFO L225 Difference]: With dead ends: 59 [2019-11-25 17:26:41,894 INFO L226 Difference]: Without dead ends: 59 [2019-11-25 17:26:41,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-25 17:26:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-25 17:26:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-11-25 17:26:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 17:26:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-25 17:26:41,902 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-11-25 17:26:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:41,902 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-25 17:26:41,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-25 17:26:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-25 17:26:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:26:41,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:41,904 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:26:42,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:42,108 INFO L410 AbstractCegarLoop]: === Iteration 10 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-11-25 17:26:42,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:42,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26882377] [2019-11-25 17:26:42,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:42,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26882377] [2019-11-25 17:26:42,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239061642] [2019-11-25 17:26:42,411 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:26:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:42,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:26:42,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:42,471 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:26:42,471 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:42,476 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:42,477 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:42,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:42,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:42,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:44,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:44,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-25 17:26:44,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512099187] [2019-11-25 17:26:44,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-25 17:26:44,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:44,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-25 17:26:44,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-25 17:26:44,911 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-11-25 17:26:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:46,541 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-25 17:26:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:26:46,542 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-25 17:26:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:46,543 INFO L225 Difference]: With dead ends: 58 [2019-11-25 17:26:46,543 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 17:26:46,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-25 17:26:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 17:26:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-25 17:26:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 17:26:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-25 17:26:46,549 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-11-25 17:26:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:46,550 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-25 17:26:46,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-25 17:26:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-25 17:26:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 17:26:46,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:46,551 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, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:46,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:46,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-11-25 17:26:46,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:46,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129676] [2019-11-25 17:26:46,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 17:26:46,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129676] [2019-11-25 17:26:46,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068324763] [2019-11-25 17:26:46,935 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:26:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:46,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 17:26:46,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:47,001 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:26:47,001 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:47,005 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:47,005 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:47,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:47,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:26:47,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-25 17:26:47,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177663169] [2019-11-25 17:26:47,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:26:47,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:26:47,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:26:47,423 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-11-25 17:26:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:47,888 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-25 17:26:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:26:47,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-25 17:26:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:47,891 INFO L225 Difference]: With dead ends: 56 [2019-11-25 17:26:47,891 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 17:26:47,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:26:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 17:26:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-25 17:26:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 17:26:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-25 17:26:47,896 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-11-25 17:26:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:47,898 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-25 17:26:47,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:26:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-25 17:26:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 17:26:47,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:47,899 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:48,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:48,116 INFO L410 AbstractCegarLoop]: === Iteration 12 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-11-25 17:26:48,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:48,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273304461] [2019-11-25 17:26:48,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 17:26:48,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273304461] [2019-11-25 17:26:48,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112136702] [2019-11-25 17:26:48,312 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:26:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:48,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 17:26:48,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:48,389 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:26:48,389 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:48,395 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:48,396 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:48,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:48,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:26:48,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-25 17:26:48,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898151987] [2019-11-25 17:26:48,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:26:48,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:26:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:26:48,864 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-11-25 17:26:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:49,341 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-25 17:26:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:26:49,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-25 17:26:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:49,343 INFO L225 Difference]: With dead ends: 55 [2019-11-25 17:26:49,343 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 17:26:49,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:26:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 17:26:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-25 17:26:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 17:26:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-25 17:26:49,348 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-11-25 17:26:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:49,351 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-25 17:26:49,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:26:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-25 17:26:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 17:26:49,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:49,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:49,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:49,554 INFO L410 AbstractCegarLoop]: === Iteration 13 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-11-25 17:26:49,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:49,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982254573] [2019-11-25 17:26:49,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 17:26:49,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982254573] [2019-11-25 17:26:49,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:49,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:26:49,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913020384] [2019-11-25 17:26:49,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:26:49,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:26:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:26:49,615 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-11-25 17:26:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:49,732 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-25 17:26:49,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:26:49,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-25 17:26:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:49,734 INFO L225 Difference]: With dead ends: 52 [2019-11-25 17:26:49,734 INFO L226 Difference]: Without dead ends: 52 [2019-11-25 17:26:49,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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:26:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-25 17:26:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-25 17:26:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 17:26:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-25 17:26:49,737 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-11-25 17:26:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:49,737 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-25 17:26:49,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:26:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-25 17:26:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 17:26:49,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:49,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:49,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-11-25 17:26:49,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:49,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570873429] [2019-11-25 17:26:49,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 17:26:49,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570873429] [2019-11-25 17:26:49,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:49,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:26:49,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666312677] [2019-11-25 17:26:49,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:26:49,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:26:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:26:49,869 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-11-25 17:26:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:50,038 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-25 17:26:50,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:50,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-25 17:26:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:50,040 INFO L225 Difference]: With dead ends: 51 [2019-11-25 17:26:50,040 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:26:50,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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:26:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:26:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:26:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:26:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:26:50,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-25 17:26:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:50,042 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:26:50,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:26:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:26:50,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:26:50,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:26:50 BoogieIcfgContainer [2019-11-25 17:26:50,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:26:50,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:26:50,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:26:50,049 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:26:50,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:26:26" (3/4) ... [2019-11-25 17:26:50,052 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:26:50,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:26:50,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-11-25 17:26:50,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:26:50,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:26:50,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-25 17:26:50,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:26:50,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-25 17:26:50,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:26:50,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 17:26:50,066 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:26:50,118 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:26:50,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:26:50,120 INFO L168 Benchmark]: Toolchain (without parser) took 24795.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 219.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:50,120 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:26:50,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:50,121 INFO L168 Benchmark]: Boogie Preprocessor took 63.20 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:50,122 INFO L168 Benchmark]: RCFGBuilder took 487.10 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:50,122 INFO L168 Benchmark]: TraceAbstraction took 23780.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.5 MB). Peak memory consumption was 225.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:50,122 INFO L168 Benchmark]: Witness Printer took 70.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:26:50,124 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.20 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.10 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23780.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.5 MB). Peak memory consumption was 225.0 MB. Max. memory is 11.5 GB. * Witness Printer took 70.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: 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 7 procedures, 63 locations, 16 error locations. Result: SAFE, OverallTime: 23.7s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 436 SDtfs, 1574 SDslu, 736 SDs, 0 SdLazy, 4297 SolverSat, 442 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, 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, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 546 ConstructedInterpolants, 78 QuantifiedInterpolants, 132425 SizeOfPredicates, 68 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 25/49 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...