./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 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-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 14:06:22,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 14:06:22,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 14:06:22,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 14:06:22,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 14:06:22,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 14:06:22,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 14:06:22,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 14:06:22,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 14:06:22,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 14:06:22,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 14:06:22,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 14:06:22,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 14:06:22,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 14:06:22,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 14:06:22,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 14:06:22,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 14:06:22,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 14:06:22,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 14:06:22,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 14:06:22,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 14:06:22,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 14:06:22,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 14:06:22,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 14:06:22,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 14:06:22,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 14:06:22,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 14:06:22,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 14:06:22,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 14:06:22,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 14:06:22,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 14:06:22,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 14:06:22,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 14:06:22,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 14:06:22,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 14:06:22,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 14:06:22,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 14:06:22,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 14:06:22,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 14:06:22,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 14:06:22,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 14:06:22,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 14:06:22,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 14:06:22,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 14:06:22,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 14:06:22,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 14:06:22,726 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 14:06:22,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 14:06:22,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 14:06:22,727 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 14:06:22,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 14:06:22,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 14:06:22,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 14:06:22,730 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 14:06:22,730 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 14:06:22,731 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 14:06:22,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 14:06:22,731 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 14:06:22,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 14:06:22,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 14:06:22,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 14:06:22,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 14:06:22,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 14:06:22,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 14:06:22,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 14:06:22,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 14:06:22,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 14:06:22,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 14:06:22,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 14:06:22,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-11-25 14:06:23,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 14:06:23,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 14:06:23,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 14:06:23,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 14:06:23,060 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 14:06:23,061 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 14:06:23,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1a8b7de/05a0fbe2b8454aea81731da41b9e79c5/FLAG06e7b94ba [2019-11-25 14:06:23,645 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 14:06:23,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2019-11-25 14:06:23,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1a8b7de/05a0fbe2b8454aea81731da41b9e79c5/FLAG06e7b94ba [2019-11-25 14:06:24,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1a8b7de/05a0fbe2b8454aea81731da41b9e79c5 [2019-11-25 14:06:24,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 14:06:24,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 14:06:24,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 14:06:24,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 14:06:24,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 14:06:24,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24, skipping insertion in model container [2019-11-25 14:06:24,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 14:06:24,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 14:06:24,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:06:24,316 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 14:06:24,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:06:24,416 INFO L208 MainTranslator]: Completed translation [2019-11-25 14:06:24,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24 WrapperNode [2019-11-25 14:06:24,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 14:06:24,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 14:06:24,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 14:06:24,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 14:06:24,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (1/1) ... [2019-11-25 14:06:24,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 14:06:24,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 14:06:24,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 14:06:24,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 14:06:24,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (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 14:06:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 14:06:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 14:06:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 14:06:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-11-25 14:06:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-25 14:06:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 14:06:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 14:06:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 14:06:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 14:06:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 14:06:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 14:06:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 14:06:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 14:06:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-11-25 14:06:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 14:06:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-25 14:06:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 14:06:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 14:06:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 14:06:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 14:06:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 14:06:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 14:06:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 14:06:24,974 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 14:06:24,974 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 14:06:24,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:24 BoogieIcfgContainer [2019-11-25 14:06:24,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 14:06:24,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 14:06:24,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 14:06:24,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 14:06:24,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 02:06:24" (1/3) ... [2019-11-25 14:06:24,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a2c5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:06:24, skipping insertion in model container [2019-11-25 14:06:24,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:24" (2/3) ... [2019-11-25 14:06:24,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a2c5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:06:24, skipping insertion in model container [2019-11-25 14:06:24,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:24" (3/3) ... [2019-11-25 14:06:24,988 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-11-25 14:06:24,998 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 14:06:25,007 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 14:06:25,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 14:06:25,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 14:06:25,047 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 14:06:25,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 14:06:25,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 14:06:25,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 14:06:25,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 14:06:25,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 14:06:25,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 14:06:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-25 14:06:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 14:06:25,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:25,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:25,082 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 14:06:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-11-25 14:06:25,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:25,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305638201] [2019-11-25 14:06:25,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:25,429 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 14:06:25,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305638201] [2019-11-25 14:06:25,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:25,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:06:25,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312247404] [2019-11-25 14:06:25,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:25,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:25,457 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-11-25 14:06:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:26,001 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-25 14:06:26,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 14:06:26,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-25 14:06:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:26,026 INFO L225 Difference]: With dead ends: 60 [2019-11-25 14:06:26,027 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 14:06:26,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 14:06:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 14:06:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 14:06:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 14:06:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-25 14:06:26,104 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-11-25 14:06:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:26,105 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-25 14:06:26,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-25 14:06:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 14:06:26,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:26,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:26,109 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 14:06:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-11-25 14:06:26,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:26,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548360674] [2019-11-25 14:06:26,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:26,435 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 14:06:26,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548360674] [2019-11-25 14:06:26,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:26,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 14:06:26,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670743069] [2019-11-25 14:06:26,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 14:06:26,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 14:06:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 14:06:26,441 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-11-25 14:06:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:27,191 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-25 14:06:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 14:06:27,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-25 14:06:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:27,199 INFO L225 Difference]: With dead ends: 70 [2019-11-25 14:06:27,200 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 14:06:27,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-25 14:06:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 14:06:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-25 14:06:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 14:06:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-25 14:06:27,214 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-25 14:06:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:27,215 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-25 14:06:27,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 14:06:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-25 14:06:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 14:06:27,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:27,216 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 14:06:27,217 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 14:06:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:27,217 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-11-25 14:06:27,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:27,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55870238] [2019-11-25 14:06:27,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:27,514 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 14:06:27,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55870238] [2019-11-25 14:06:27,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:27,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 14:06:27,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627300014] [2019-11-25 14:06:27,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 14:06:27,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 14:06:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 14:06:27,518 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-11-25 14:06:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:28,217 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-25 14:06:28,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 14:06:28,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 14:06:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:28,224 INFO L225 Difference]: With dead ends: 69 [2019-11-25 14:06:28,224 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 14:06:28,225 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 14:06:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 14:06:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-25 14:06:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 14:06:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 14:06:28,233 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-11-25 14:06:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:28,233 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 14:06:28,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 14:06:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 14:06:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 14:06:28,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:28,235 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 14:06:28,235 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 14:06:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-11-25 14:06:28,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:28,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973447943] [2019-11-25 14:06:28,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,292 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 14:06:28,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973447943] [2019-11-25 14:06:28,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:28,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 14:06:28,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383944463] [2019-11-25 14:06:28,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 14:06:28,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 14:06:28,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 14:06:28,295 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-25 14:06:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:28,500 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-25 14:06:28,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 14:06:28,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 14:06:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:28,503 INFO L225 Difference]: With dead ends: 61 [2019-11-25 14:06:28,503 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 14:06:28,504 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 14:06:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 14:06:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-25 14:06:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 14:06:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-25 14:06:28,511 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-11-25 14:06:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:28,511 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-25 14:06:28,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 14:06:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-25 14:06:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 14:06:28,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:28,512 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 14:06:28,513 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 14:06:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-11-25 14:06:28,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:28,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015676611] [2019-11-25 14:06:28,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,773 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 14:06:28,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015676611] [2019-11-25 14:06:28,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149436452] [2019-11-25 14:06:28,774 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 14:06:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:28,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 14:06:28,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:28,927 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 14:06:28,928 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:28,936 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:28,937 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:28,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 14:06:29,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:29,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:29,261 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 14:06:29,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:29,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-25 14:06:29,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551123352] [2019-11-25 14:06:29,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 14:06:29,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 14:06:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 14:06:29,264 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-11-25 14:06:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:30,208 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-25 14:06:30,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 14:06:30,209 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-25 14:06:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:30,211 INFO L225 Difference]: With dead ends: 69 [2019-11-25 14:06:30,211 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 14:06:30,212 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 14:06:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 14:06:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-25 14:06:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 14:06:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 14:06:30,221 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-11-25 14:06:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:30,223 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 14:06:30,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 14:06:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 14:06:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 14:06:30,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:30,224 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 14:06:30,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:30,434 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 14:06:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-11-25 14:06:30,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:30,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158095239] [2019-11-25 14:06:30,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:30,561 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 14:06:30,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158095239] [2019-11-25 14:06:30,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:30,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 14:06:30,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591572707] [2019-11-25 14:06:30,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 14:06:30,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 14:06:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 14:06:30,564 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-11-25 14:06:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:30,943 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-25 14:06:30,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 14:06:30,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-25 14:06:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:30,945 INFO L225 Difference]: With dead ends: 69 [2019-11-25 14:06:30,945 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 14:06:30,946 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 14:06:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 14:06:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-25 14:06:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 14:06:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-25 14:06:30,952 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-11-25 14:06:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:30,952 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-25 14:06:30,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 14:06:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-25 14:06:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 14:06:30,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:30,953 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 14:06:30,954 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 14:06:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-11-25 14:06:30,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:30,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700560569] [2019-11-25 14:06:30,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,141 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 14:06:31,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700560569] [2019-11-25 14:06:31,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317937720] [2019-11-25 14:06:31,142 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 14:06:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:31,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 14:06:31,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:31,206 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 14:06:31,207 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,212 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:31,212 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:31,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 14:06:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:31,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:31,466 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 14:06:31,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:31,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-25 14:06:31,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178919350] [2019-11-25 14:06:31,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 14:06:31,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:31,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 14:06:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 14:06:31,469 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-11-25 14:06:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:32,459 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 14:06:32,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 14:06:32,459 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-25 14:06:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:32,460 INFO L225 Difference]: With dead ends: 64 [2019-11-25 14:06:32,460 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 14:06:32,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-11-25 14:06:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 14:06:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-25 14:06:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 14:06:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-25 14:06:32,467 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-11-25 14:06:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:32,468 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-25 14:06:32,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 14:06:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-25 14:06:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 14:06:32,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:32,469 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 14:06:32,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:32,673 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 14:06:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-11-25 14:06:32,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:32,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164701557] [2019-11-25 14:06:32,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:32,781 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 14:06:32,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164701557] [2019-11-25 14:06:32,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:32,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:06:32,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988875259] [2019-11-25 14:06:32,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:32,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:32,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:32,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:32,784 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-11-25 14:06:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:33,041 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-25 14:06:33,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 14:06:33,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-25 14:06:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:33,043 INFO L225 Difference]: With dead ends: 57 [2019-11-25 14:06:33,043 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 14:06:33,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 14:06:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 14:06:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 14:06:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 14:06:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-25 14:06:33,049 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-11-25 14:06:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:33,049 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-25 14:06:33,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-25 14:06:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 14:06:33,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:33,051 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 14:06:33,051 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 14:06:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-11-25 14:06:33,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:33,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751616713] [2019-11-25 14:06:33,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,361 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 14:06:33,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751616713] [2019-11-25 14:06:33,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914573729] [2019-11-25 14:06:33,362 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 14:06:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:33,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 14:06:33,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:33,434 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 14:06:33,435 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,447 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:33,448 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:33,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 14:06:33,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:33,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:36,012 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 14:06:36,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:36,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-25 14:06:36,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811980503] [2019-11-25 14:06:36,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-25 14:06:36,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:36,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-25 14:06:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-25 14:06:36,015 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-11-25 14:06:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:37,749 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-25 14:06:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 14:06:37,750 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-25 14:06:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:37,751 INFO L225 Difference]: With dead ends: 59 [2019-11-25 14:06:37,751 INFO L226 Difference]: Without dead ends: 59 [2019-11-25 14:06:37,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 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 14:06:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-25 14:06:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-11-25 14:06:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 14:06:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-25 14:06:37,758 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-11-25 14:06:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:37,758 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-25 14:06:37,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-25 14:06:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-25 14:06:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 14:06:37,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:37,760 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 14:06:37,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:37,964 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 14:06:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-11-25 14:06:37,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:37,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910510731] [2019-11-25 14:06:37,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:38,318 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 14:06:38,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910510731] [2019-11-25 14:06:38,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460919946] [2019-11-25 14:06:38,319 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 14:06:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:38,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 14:06:38,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:38,397 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 14:06:38,397 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:38,402 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:38,402 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:38,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 14:06:38,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:38,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:06:40,924 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 14:06:40,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:40,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-25 14:06:40,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855542323] [2019-11-25 14:06:40,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-25 14:06:40,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:40,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-25 14:06:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-25 14:06:40,927 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-11-25 14:06:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:42,547 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-25 14:06:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 14:06:42,547 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-25 14:06:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:42,549 INFO L225 Difference]: With dead ends: 58 [2019-11-25 14:06:42,549 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 14:06:42,551 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 14:06:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 14:06:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-25 14:06:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 14:06:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-25 14:06:42,556 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-11-25 14:06:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:42,557 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-25 14:06:42,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-25 14:06:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-25 14:06:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 14:06:42,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:42,558 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 14:06:42,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:42,762 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 14:06:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-11-25 14:06:42,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:42,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583666267] [2019-11-25 14:06:42,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:42,969 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 14:06:42,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583666267] [2019-11-25 14:06:42,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819419459] [2019-11-25 14:06:42,970 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 14:06:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:43,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 14:06:43,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:43,044 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 14:06:43,044 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:43,049 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:43,050 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:43,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 14:06:43,536 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 14:06:43,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:06:43,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-25 14:06:43,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272160247] [2019-11-25 14:06:43,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 14:06:43,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 14:06:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-25 14:06:43,538 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-11-25 14:06:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:44,036 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-25 14:06:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 14:06:44,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-25 14:06:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:44,037 INFO L225 Difference]: With dead ends: 56 [2019-11-25 14:06:44,038 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 14:06:44,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 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 14:06:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 14:06:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-25 14:06:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 14:06:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-25 14:06:44,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-11-25 14:06:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:44,044 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-25 14:06:44,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 14:06:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-25 14:06:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 14:06:44,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:44,046 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 14:06:44,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:44,247 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 14:06:44,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:44,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-11-25 14:06:44,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:44,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150214154] [2019-11-25 14:06:44,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:44,492 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 14:06:44,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150214154] [2019-11-25 14:06:44,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358958955] [2019-11-25 14:06:44,494 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 14:06:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:44,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 14:06:44,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:44,575 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 14:06:44,575 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:06:44,580 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:06:44,580 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:06:44,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 14:06:45,101 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 14:06:45,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:06:45,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-25 14:06:45,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449887150] [2019-11-25 14:06:45,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 14:06:45,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 14:06:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-25 14:06:45,103 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-11-25 14:06:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:45,610 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-25 14:06:45,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 14:06:45,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-25 14:06:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:45,617 INFO L225 Difference]: With dead ends: 55 [2019-11-25 14:06:45,617 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 14:06:45,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-25 14:06:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 14:06:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-25 14:06:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 14:06:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-25 14:06:45,631 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-11-25 14:06:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:45,631 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-25 14:06:45,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 14:06:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-25 14:06:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 14:06:45,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:45,636 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 14:06:45,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:45,837 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 14:06:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-11-25 14:06:45,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:45,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018688844] [2019-11-25 14:06:45,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:45,906 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 14:06:45,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018688844] [2019-11-25 14:06:45,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:45,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 14:06:45,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672778481] [2019-11-25 14:06:45,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 14:06:45,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 14:06:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 14:06:45,909 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-11-25 14:06:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:46,059 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-25 14:06:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 14:06:46,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-25 14:06:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:46,061 INFO L225 Difference]: With dead ends: 52 [2019-11-25 14:06:46,061 INFO L226 Difference]: Without dead ends: 52 [2019-11-25 14:06:46,061 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 14:06:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-25 14:06:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-25 14:06:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 14:06:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-25 14:06:46,066 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-11-25 14:06:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:46,066 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-25 14:06:46,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 14:06:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-25 14:06:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 14:06:46,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:46,071 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 14:06:46,071 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 14:06:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-11-25 14:06:46,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:46,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951222936] [2019-11-25 14:06:46,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:46,225 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 14:06:46,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951222936] [2019-11-25 14:06:46,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:46,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:46,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165613431] [2019-11-25 14:06:46,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:06:46,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:46,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:06:46,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:06:46,228 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-11-25 14:06:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:46,434 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-25 14:06:46,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:06:46,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-25 14:06:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:46,435 INFO L225 Difference]: With dead ends: 51 [2019-11-25 14:06:46,435 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 14:06:46,436 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 14:06:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 14:06:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 14:06:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 14:06:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 14:06:46,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-25 14:06:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:46,437 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 14:06:46,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:06:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 14:06:46,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 14:06:46,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 02:06:46 BoogieIcfgContainer [2019-11-25 14:06:46,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 14:06:46,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 14:06:46,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 14:06:46,444 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 14:06:46,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:24" (3/4) ... [2019-11-25 14:06:46,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 14:06:46,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 14:06:46,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-11-25 14:06:46,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 14:06:46,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 14:06:46,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-25 14:06:46,455 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 14:06:46,460 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-25 14:06:46,461 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 14:06:46,461 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 14:06:46,461 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 14:06:46,522 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 14:06:46,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 14:06:46,529 INFO L168 Benchmark]: Toolchain (without parser) took 22507.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -114.7 MB). Peak memory consumption was 220.3 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:46,529 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 14:06:46,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:46,530 INFO L168 Benchmark]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 14:06:46,530 INFO L168 Benchmark]: RCFGBuilder took 516.90 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:46,530 INFO L168 Benchmark]: TraceAbstraction took 21466.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:46,531 INFO L168 Benchmark]: Witness Printer took 79.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:46,532 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 516.90 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21466.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * Witness Printer took 79.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. 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: 21.3s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 434 SDtfs, 1592 SDslu, 736 SDs, 0 SdLazy, 4289 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 11.6s 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.4s SatisfiabilityAnalysisTime, 9.4s 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...