./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 17d20a29a9e9cc6560e9aa0daac36f5de29f992c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:59:02,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:59:02,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:59:02,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:59:02,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:59:02,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:59:02,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:59:02,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:59:02,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:59:02,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:59:02,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:59:02,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:59:02,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:59:02,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:59:02,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:59:02,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:59:02,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:59:02,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:59:02,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:59:02,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:59:02,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:59:02,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:59:02,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:59:02,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:59:02,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:59:02,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:59:02,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:59:02,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:59:02,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:59:02,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:59:02,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:59:02,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:59:02,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:59:02,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:59:02,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:59:02,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:59:02,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:59:02,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:59:02,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:59:02,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:59:02,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:59:02,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:59:02,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:59:02,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:59:02,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:59:02,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:59:02,710 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:59:02,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:59:02,711 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:59:02,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:59:02,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:59:02,712 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:59:02,713 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:59:02,713 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:59:02,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:59:02,714 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:59:02,714 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:59:02,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:59:02,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:59:02,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:59:02,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:59:02,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:02,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:59:02,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:59:02,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:59:02,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:59:02,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17d20a29a9e9cc6560e9aa0daac36f5de29f992c [2019-11-22 13:59:03,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:59:03,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:59:03,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:59:03,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:59:03,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:59:03,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-22 13:59:03,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd252947a/044109332f6e407ebf67d6e4583b12fd/FLAG376cdf81c [2019-11-22 13:59:03,620 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:59:03,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-22 13:59:03,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd252947a/044109332f6e407ebf67d6e4583b12fd/FLAG376cdf81c [2019-11-22 13:59:04,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd252947a/044109332f6e407ebf67d6e4583b12fd [2019-11-22 13:59:04,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:59:04,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:59:04,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:04,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:59:04,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:59:04,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645b051c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04, skipping insertion in model container [2019-11-22 13:59:04,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:59:04,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:59:04,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:04,309 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:59:04,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:04,426 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:59:04,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04 WrapperNode [2019-11-22 13:59:04,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:04,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:59:04,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:59:04,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:59:04,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... [2019-11-22 13:59:04,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:59:04,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:59:04,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:59:04,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:59:04,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:04,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:59:04,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:59:04,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 13:59:04,527 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 13:59:04,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:59:04,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 13:59:04,527 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:59:04,527 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:59:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:59:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 13:59:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 13:59:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:59:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 13:59:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:59:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:59:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:59:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 13:59:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:59:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:59:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:59:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:59:04,875 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:59:04,875 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-22 13:59:04,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:04 BoogieIcfgContainer [2019-11-22 13:59:04,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:59:04,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:59:04,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:59:04,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:59:04,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:59:04" (1/3) ... [2019-11-22 13:59:04,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f64f625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:04, skipping insertion in model container [2019-11-22 13:59:04,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:04" (2/3) ... [2019-11-22 13:59:04,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f64f625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:04, skipping insertion in model container [2019-11-22 13:59:04,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:04" (3/3) ... [2019-11-22 13:59:04,891 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-11-22 13:59:04,901 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:59:04,907 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-22 13:59:04,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-22 13:59:04,939 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:59:04,939 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:59:04,939 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:59:04,939 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:59:04,939 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:59:04,940 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:59:04,940 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:59:04,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:59:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-22 13:59:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:59:04,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:04,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:04,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:04,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-11-22 13:59:04,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:04,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806111302] [2019-11-22 13:59:04,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:05,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806111302] [2019-11-22 13:59:05,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:05,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:05,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74044355] [2019-11-22 13:59:05,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:05,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:05,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:05,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:05,313 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-22 13:59:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:05,662 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-22 13:59:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:05,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-22 13:59:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:05,675 INFO L225 Difference]: With dead ends: 52 [2019-11-22 13:59:05,676 INFO L226 Difference]: Without dead ends: 49 [2019-11-22 13:59:05,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:59:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-22 13:59:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-22 13:59:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-22 13:59:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-22 13:59:05,723 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-11-22 13:59:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:05,726 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-22 13:59:05,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-22 13:59:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:59:05,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:05,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:05,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-11-22 13:59:05,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:05,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085628663] [2019-11-22 13:59:05,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:05,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085628663] [2019-11-22 13:59:05,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:05,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:05,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898717265] [2019-11-22 13:59:05,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:05,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:05,907 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-22 13:59:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:06,139 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-22 13:59:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:59:06,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-22 13:59:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:06,142 INFO L225 Difference]: With dead ends: 48 [2019-11-22 13:59:06,142 INFO L226 Difference]: Without dead ends: 48 [2019-11-22 13:59:06,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:59:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-22 13:59:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-22 13:59:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-22 13:59:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-22 13:59:06,152 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-11-22 13:59:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:06,153 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-22 13:59:06,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-22 13:59:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 13:59:06,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:06,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:06,156 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-11-22 13:59:06,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:06,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214893648] [2019-11-22 13:59:06,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:06,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214893648] [2019-11-22 13:59:06,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:06,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:06,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401457181] [2019-11-22 13:59:06,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:06,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:06,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:06,275 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-11-22 13:59:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:06,512 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-22 13:59:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:59:06,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-22 13:59:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:06,514 INFO L225 Difference]: With dead ends: 47 [2019-11-22 13:59:06,514 INFO L226 Difference]: Without dead ends: 47 [2019-11-22 13:59:06,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:59:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-22 13:59:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-22 13:59:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-22 13:59:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-22 13:59:06,522 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-22 13:59:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:06,522 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-22 13:59:06,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-22 13:59:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 13:59:06,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:06,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:06,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-11-22 13:59:06,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:06,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517388097] [2019-11-22 13:59:06,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:06,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517388097] [2019-11-22 13:59:06,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:06,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:06,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340605498] [2019-11-22 13:59:06,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:06,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:06,661 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-11-22 13:59:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:06,949 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-22 13:59:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:59:06,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 13:59:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:06,951 INFO L225 Difference]: With dead ends: 43 [2019-11-22 13:59:06,951 INFO L226 Difference]: Without dead ends: 43 [2019-11-22 13:59:06,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:59:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-22 13:59:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-22 13:59:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-22 13:59:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-22 13:59:06,959 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-11-22 13:59:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:06,959 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-22 13:59:06,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-22 13:59:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 13:59:06,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:06,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:06,962 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-11-22 13:59:06,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:06,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762495394] [2019-11-22 13:59:06,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:07,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762495394] [2019-11-22 13:59:07,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:07,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 13:59:07,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730495594] [2019-11-22 13:59:07,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 13:59:07,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 13:59:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:59:07,121 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-11-22 13:59:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:07,761 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-22 13:59:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:59:07,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-22 13:59:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:07,766 INFO L225 Difference]: With dead ends: 77 [2019-11-22 13:59:07,766 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 13:59:07,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-22 13:59:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 13:59:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-22 13:59:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 13:59:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-22 13:59:07,777 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-11-22 13:59:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:07,778 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-22 13:59:07,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 13:59:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-22 13:59:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 13:59:07,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:07,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:07,779 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-11-22 13:59:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:07,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469425627] [2019-11-22 13:59:07,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:07,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469425627] [2019-11-22 13:59:07,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:07,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:59:07,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371968241] [2019-11-22 13:59:07,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:59:07,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:59:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:07,900 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-11-22 13:59:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:08,120 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-22 13:59:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:08,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 13:59:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:08,123 INFO L225 Difference]: With dead ends: 60 [2019-11-22 13:59:08,123 INFO L226 Difference]: Without dead ends: 55 [2019-11-22 13:59:08,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 13:59:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-22 13:59:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-22 13:59:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 13:59:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-22 13:59:08,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-22 13:59:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:08,140 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-22 13:59:08,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:59:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-22 13:59:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:59:08,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:08,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:08,142 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:08,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-11-22 13:59:08,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:08,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749254177] [2019-11-22 13:59:08,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:08,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749254177] [2019-11-22 13:59:08,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:08,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 13:59:08,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784114812] [2019-11-22 13:59:08,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:59:08,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:59:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:59:08,307 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-11-22 13:59:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:08,858 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-22 13:59:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 13:59:08,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 13:59:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:08,859 INFO L225 Difference]: With dead ends: 68 [2019-11-22 13:59:08,862 INFO L226 Difference]: Without dead ends: 68 [2019-11-22 13:59:08,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:59:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-22 13:59:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-11-22 13:59:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 13:59:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-22 13:59:08,873 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-11-22 13:59:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:08,873 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-22 13:59:08,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:59:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-22 13:59:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 13:59:08,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:08,875 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:08,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-11-22 13:59:08,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:08,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760155312] [2019-11-22 13:59:08,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:09,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760155312] [2019-11-22 13:59:09,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27119560] [2019-11-22 13:59:09,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:09,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 13:59:09,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:09,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:09,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-22 13:59:09,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207027477] [2019-11-22 13:59:09,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 13:59:09,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 13:59:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-22 13:59:09,351 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-11-22 13:59:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:10,509 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-11-22 13:59:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-22 13:59:10,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-22 13:59:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:10,511 INFO L225 Difference]: With dead ends: 80 [2019-11-22 13:59:10,511 INFO L226 Difference]: Without dead ends: 80 [2019-11-22 13:59:10,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-11-22 13:59:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-22 13:59:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-22 13:59:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 13:59:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-22 13:59:10,520 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-11-22 13:59:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:10,521 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-22 13:59:10,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 13:59:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-22 13:59:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 13:59:10,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:10,522 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:10,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:10,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-11-22 13:59:10,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:10,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765562995] [2019-11-22 13:59:10,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:11,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765562995] [2019-11-22 13:59:11,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782686019] [2019-11-22 13:59:11,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:11,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 13:59:11,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:11,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:11,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-22 13:59:11,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567925938] [2019-11-22 13:59:11,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 13:59:11,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 13:59:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-22 13:59:11,533 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-11-22 13:59:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:16,265 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-22 13:59:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-22 13:59:16,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-22 13:59:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:16,269 INFO L225 Difference]: With dead ends: 110 [2019-11-22 13:59:16,269 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 13:59:16,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2019-11-22 13:59:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 13:59:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-11-22 13:59:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-22 13:59:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-22 13:59:16,297 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-11-22 13:59:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:16,298 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-22 13:59:16,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 13:59:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-22 13:59:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 13:59:16,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:16,301 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:16,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:16,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-11-22 13:59:16,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:16,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742449789] [2019-11-22 13:59:16,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 13:59:16,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742449789] [2019-11-22 13:59:16,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595294354] [2019-11-22 13:59:16,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:59:16,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:16,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:16,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:16,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:16,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:16,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:17,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:17,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 13:59:17,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346896236] [2019-11-22 13:59:17,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 13:59:17,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 13:59:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:59:17,190 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-11-22 13:59:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:19,040 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-11-22 13:59:19,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 13:59:19,041 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-22 13:59:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:19,043 INFO L225 Difference]: With dead ends: 115 [2019-11-22 13:59:19,043 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 13:59:19,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 13:59:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 13:59:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-11-22 13:59:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-22 13:59:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-22 13:59:19,053 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-11-22 13:59:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:19,053 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-22 13:59:19,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 13:59:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-22 13:59:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 13:59:19,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:19,055 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:19,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:19,259 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-11-22 13:59:19,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:19,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986856749] [2019-11-22 13:59:19,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:19,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986856749] [2019-11-22 13:59:19,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117652354] [2019-11-22 13:59:19,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:59:19,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:19,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-11-22 13:59:19,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:19,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:19,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:19,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-22 13:59:21,789 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-22 13:59:21,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-11-22 13:59:21,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:21,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:21,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 13:59:21,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-22 13:59:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:21,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:21,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-22 13:59:21,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414582902] [2019-11-22 13:59:21,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:59:21,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:59:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-22 13:59:21,908 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-11-22 13:59:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:22,062 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-22 13:59:22,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:59:22,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-22 13:59:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:22,063 INFO L225 Difference]: With dead ends: 83 [2019-11-22 13:59:22,064 INFO L226 Difference]: Without dead ends: 63 [2019-11-22 13:59:22,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-11-22 13:59:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-22 13:59:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-22 13:59:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 13:59:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-22 13:59:22,073 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-11-22 13:59:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:22,074 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-22 13:59:22,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:59:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-22 13:59:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 13:59:22,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:22,080 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:22,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:22,290 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:22,290 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-11-22 13:59:22,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:22,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228558045] [2019-11-22 13:59:22,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 13:59:22,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228558045] [2019-11-22 13:59:22,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201751238] [2019-11-22 13:59:22,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:22,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:59:22,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:22,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:22,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:22,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:22,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:22,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:22,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:22,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 13:59:22,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196192081] [2019-11-22 13:59:22,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 13:59:22,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 13:59:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:59:22,930 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-11-22 13:59:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:24,128 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-22 13:59:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-22 13:59:24,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-22 13:59:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:24,130 INFO L225 Difference]: With dead ends: 63 [2019-11-22 13:59:24,130 INFO L226 Difference]: Without dead ends: 63 [2019-11-22 13:59:24,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-11-22 13:59:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-22 13:59:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-22 13:59:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 13:59:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-22 13:59:24,135 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-11-22 13:59:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:24,135 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-22 13:59:24,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 13:59:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-22 13:59:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 13:59:24,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:24,137 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:24,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:24,341 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-11-22 13:59:24,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:24,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725508754] [2019-11-22 13:59:24,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-22 13:59:24,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725508754] [2019-11-22 13:59:24,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98863921] [2019-11-22 13:59:24,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:24,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-22 13:59:24,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 13:59:25,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-22 13:59:25,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924771528] [2019-11-22 13:59:25,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 13:59:25,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:25,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 13:59:25,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-22 13:59:25,186 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-22 13:59:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:27,395 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 13:59:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 13:59:27,396 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-22 13:59:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:27,397 INFO L225 Difference]: With dead ends: 66 [2019-11-22 13:59:27,397 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 13:59:27,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 13:59:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 13:59:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 13:59:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 13:59:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 13:59:27,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-22 13:59:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:27,400 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 13:59:27,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 13:59:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 13:59:27,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 13:59:27,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:27,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:59:27 BoogieIcfgContainer [2019-11-22 13:59:27,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 13:59:27,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 13:59:27,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 13:59:27,610 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 13:59:27,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:04" (3/4) ... [2019-11-22 13:59:27,613 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 13:59:27,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 13:59:27,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 13:59:27,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 13:59:27,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 13:59:27,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 13:59:27,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-22 13:59:27,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 13:59:27,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 13:59:27,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 13:59:27,677 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 13:59:27,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 13:59:27,679 INFO L168 Benchmark]: Toolchain (without parser) took 23672.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -263.6 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:27,680 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:27,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:27,681 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 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-22 13:59:27,681 INFO L168 Benchmark]: RCFGBuilder took 412.74 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:27,682 INFO L168 Benchmark]: TraceAbstraction took 22723.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -126.1 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:27,682 INFO L168 Benchmark]: Witness Printer took 67.52 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:27,685 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.25 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 419.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.48 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 412.74 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22723.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -126.1 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. * Witness Printer took 67.52 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 12 error locations. Result: SAFE, OverallTime: 22.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1965 SDslu, 712 SDs, 0 SdLazy, 4878 SolverSat, 989 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 247 SyntacticMatches, 11 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 32 QuantifiedInterpolants, 129907 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1012 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 49/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...