./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5a079682 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:02:57,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:02:57,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:02:57,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:02:57,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:02:57,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:02:57,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:02:57,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:02:57,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:02:57,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:02:57,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:02:57,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:02:57,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:02:57,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:02:57,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:02:57,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:02:57,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:02:57,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:02:57,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:02:57,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:02:57,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:02:57,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:02:57,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:02:57,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:02:57,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:02:57,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:02:57,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:02:57,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:02:57,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:02:57,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:02:57,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:02:57,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:02:57,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:02:57,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:02:57,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:02:57,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:02:57,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:02:57,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:02:57,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:02:57,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:02:57,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:02:57,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 11:02:58,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:02:58,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:02:58,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:02:58,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:02:58,015 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:02:58,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:02:58,016 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:02:58,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:02:58,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:02:58,016 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:02:58,017 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:02:58,018 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:02:58,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:02:58,018 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:02:58,019 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:02:58,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:02:58,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:02:58,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:02:58,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:02:58,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:02:58,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:02:58,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:02:58,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:02:58,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:02:58,021 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 -> f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 [2019-11-22 11:02:58,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:02:58,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:02:58,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:02:58,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:02:58,379 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:02:58,380 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-22 11:02:58,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc714ca1/40afe06cbb724005bd904e2bc432a817/FLAG7ffcaddda [2019-11-22 11:02:58,873 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:02:58,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-22 11:02:58,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc714ca1/40afe06cbb724005bd904e2bc432a817/FLAG7ffcaddda [2019-11-22 11:02:59,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc714ca1/40afe06cbb724005bd904e2bc432a817 [2019-11-22 11:02:59,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:02:59,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:02:59,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:02:59,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:02:59,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:02:59,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae4b5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59, skipping insertion in model container [2019-11-22 11:02:59,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:02:59,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:02:59,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:02:59,597 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:02:59,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:02:59,711 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:02:59,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59 WrapperNode [2019-11-22 11:02:59,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:02:59,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:02:59,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:02:59,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:02:59,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:02:59,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:02:59,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:02:59,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:02:59,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (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 11:02:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:02:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:02:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 11:02:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 11:02:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:02:59,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 11:02:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:02:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:02:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:02:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 11:02:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 11:02:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:02:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 11:02:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:02:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:02:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:02:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 11:02:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:02:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:02:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:02:59,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:03:00,243 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:03:00,243 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-22 11:03:00,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:00 BoogieIcfgContainer [2019-11-22 11:03:00,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:03:00,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:03:00,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:03:00,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:03:00,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:02:59" (1/3) ... [2019-11-22 11:03:00,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231e7f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:03:00, skipping insertion in model container [2019-11-22 11:03:00,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (2/3) ... [2019-11-22 11:03:00,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231e7f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:03:00, skipping insertion in model container [2019-11-22 11:03:00,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:00" (3/3) ... [2019-11-22 11:03:00,252 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2019-11-22 11:03:00,262 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:03:00,269 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-22 11:03:00,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-22 11:03:00,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:03:00,302 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:03:00,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:03:00,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:03:00,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:03:00,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:03:00,303 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:03:00,303 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:03:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-22 11:03:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 11:03:00,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:00,332 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 11:03:00,333 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957205, now seen corresponding path program 1 times [2019-11-22 11:03:00,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:00,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846981114] [2019-11-22 11:03:00,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,650 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 11:03:00,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846981114] [2019-11-22 11:03:00,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:00,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:03:00,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118077017] [2019-11-22 11:03:00,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:00,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:03:00,681 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2019-11-22 11:03:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:01,052 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-22 11:03:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:03:01,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-22 11:03:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:01,066 INFO L225 Difference]: With dead ends: 59 [2019-11-22 11:03:01,067 INFO L226 Difference]: Without dead ends: 56 [2019-11-22 11:03:01,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-22 11:03:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-22 11:03:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-22 11:03:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-22 11:03:01,112 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 18 [2019-11-22 11:03:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:01,114 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-22 11:03:01,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-22 11:03:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 11:03:01,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:01,116 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 11:03:01,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957204, now seen corresponding path program 1 times [2019-11-22 11:03:01,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:01,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126336437] [2019-11-22 11:03:01,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,350 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 11:03:01,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126336437] [2019-11-22 11:03:01,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:01,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:01,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513911876] [2019-11-22 11:03:01,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:01,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:01,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:01,359 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2019-11-22 11:03:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:01,673 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-22 11:03:01,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:03:01,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-22 11:03:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:01,676 INFO L225 Difference]: With dead ends: 54 [2019-11-22 11:03:01,676 INFO L226 Difference]: Without dead ends: 54 [2019-11-22 11:03:01,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-22 11:03:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-22 11:03:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 11:03:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-22 11:03:01,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2019-11-22 11:03:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:01,687 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-22 11:03:01,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-22 11:03:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 11:03:01,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:01,689 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 11:03:01,689 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2036436141, now seen corresponding path program 1 times [2019-11-22 11:03:01,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:01,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789185292] [2019-11-22 11:03:01,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,946 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 11:03:01,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789185292] [2019-11-22 11:03:01,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:01,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:03:01,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719809709] [2019-11-22 11:03:01,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:03:01,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:01,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:03:01,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:01,951 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-11-22 11:03:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:02,527 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-22 11:03:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 11:03:02,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-22 11:03:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:02,532 INFO L225 Difference]: With dead ends: 82 [2019-11-22 11:03:02,532 INFO L226 Difference]: Without dead ends: 82 [2019-11-22 11:03:02,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:03:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-22 11:03:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-22 11:03:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 11:03:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-22 11:03:02,544 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 20 [2019-11-22 11:03:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:02,545 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-22 11:03:02,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:03:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-22 11:03:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:03:02,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:02,546 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 11:03:02,547 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818779, now seen corresponding path program 1 times [2019-11-22 11:03:02,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:02,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084948667] [2019-11-22 11:03:02,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,675 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 11:03:02,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084948667] [2019-11-22 11:03:02,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:02,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:03:02,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388708970] [2019-11-22 11:03:02,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:03:02,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:03:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:03:02,678 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2019-11-22 11:03:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:02,992 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-22 11:03:02,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:03:02,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 11:03:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:02,994 INFO L225 Difference]: With dead ends: 56 [2019-11-22 11:03:02,994 INFO L226 Difference]: Without dead ends: 56 [2019-11-22 11:03:02,997 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 11:03:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-22 11:03:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-22 11:03:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-22 11:03:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-11-22 11:03:03,010 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 21 [2019-11-22 11:03:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:03,011 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-22 11:03:03,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:03:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-11-22 11:03:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:03:03,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:03,012 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 11:03:03,013 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818778, now seen corresponding path program 1 times [2019-11-22 11:03:03,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:03,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814501478] [2019-11-22 11:03:03,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,231 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 11:03:03,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814501478] [2019-11-22 11:03:03,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:03,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 11:03:03,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890556279] [2019-11-22 11:03:03,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:03:03,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:03:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:03,234 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-11-22 11:03:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:03,991 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-22 11:03:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:03:03,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-22 11:03:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:03,993 INFO L225 Difference]: With dead ends: 90 [2019-11-22 11:03:03,993 INFO L226 Difference]: Without dead ends: 90 [2019-11-22 11:03:03,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:03:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-22 11:03:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2019-11-22 11:03:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-22 11:03:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-22 11:03:04,016 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 21 [2019-11-22 11:03:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:04,017 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-22 11:03:04,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:03:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-22 11:03:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 11:03:04,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:04,019 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 11:03:04,019 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash -486807298, now seen corresponding path program 1 times [2019-11-22 11:03:04,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:04,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737468733] [2019-11-22 11:03:04,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,228 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 11:03:04,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737468733] [2019-11-22 11:03:04,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:04,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 11:03:04,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526194133] [2019-11-22 11:03:04,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:03:04,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:03:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:04,230 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 10 states. [2019-11-22 11:03:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:04,819 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-22 11:03:04,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:03:04,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 11:03:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:04,824 INFO L225 Difference]: With dead ends: 87 [2019-11-22 11:03:04,825 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 11:03:04,825 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 11:03:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 11:03:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2019-11-22 11:03:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-22 11:03:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-22 11:03:04,834 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 22 [2019-11-22 11:03:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:04,835 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-22 11:03:04,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:03:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-22 11:03:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-22 11:03:04,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:04,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:04,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1532204726, now seen corresponding path program 1 times [2019-11-22 11:03:04,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:04,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263822992] [2019-11-22 11:03:04,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,934 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 11:03:04,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263822992] [2019-11-22 11:03:04,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:04,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:03:04,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669467774] [2019-11-22 11:03:04,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:04,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:03:04,937 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2019-11-22 11:03:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:05,110 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-11-22 11:03:05,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:03:05,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-22 11:03:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:05,112 INFO L225 Difference]: With dead ends: 73 [2019-11-22 11:03:05,113 INFO L226 Difference]: Without dead ends: 73 [2019-11-22 11:03:05,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-22 11:03:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-22 11:03:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-22 11:03:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-11-22 11:03:05,121 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 28 [2019-11-22 11:03:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:05,122 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-11-22 11:03:05,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-11-22 11:03:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 11:03:05,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:05,123 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 11:03:05,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1010784573, now seen corresponding path program 1 times [2019-11-22 11:03:05,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:05,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658114705] [2019-11-22 11:03:05,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,264 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 11:03:05,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658114705] [2019-11-22 11:03:05,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261949475] [2019-11-22 11:03:05,265 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 11:03:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:03:05,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:05,627 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 11:03:05,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:05,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-22 11:03:05,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381974766] [2019-11-22 11:03:05,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 11:03:05,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:05,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 11:03:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:03:05,629 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 17 states. [2019-11-22 11:03:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:09,144 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2019-11-22 11:03:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 11:03:09,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-22 11:03:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:09,147 INFO L225 Difference]: With dead ends: 135 [2019-11-22 11:03:09,147 INFO L226 Difference]: Without dead ends: 135 [2019-11-22 11:03:09,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-22 11:03:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-22 11:03:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2019-11-22 11:03:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-22 11:03:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-11-22 11:03:09,160 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 30 [2019-11-22 11:03:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:09,160 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-11-22 11:03:09,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 11:03:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-11-22 11:03:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 11:03:09,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:09,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:09,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:09,365 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -725039271, now seen corresponding path program 1 times [2019-11-22 11:03:09,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:09,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785372437] [2019-11-22 11:03:09,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,470 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 11:03:09,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785372437] [2019-11-22 11:03:09,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:09,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:09,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119104503] [2019-11-22 11:03:09,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:09,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:09,473 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 7 states. [2019-11-22 11:03:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:09,653 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2019-11-22 11:03:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:09,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-22 11:03:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:09,658 INFO L225 Difference]: With dead ends: 108 [2019-11-22 11:03:09,658 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 11:03:09,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 11:03:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-22 11:03:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 11:03:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-11-22 11:03:09,677 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 30 [2019-11-22 11:03:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:09,677 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-11-22 11:03:09,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-11-22 11:03:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 11:03:09,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:09,678 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 11:03:09,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash -701366204, now seen corresponding path program 1 times [2019-11-22 11:03:09,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:09,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886909690] [2019-11-22 11:03:09,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,942 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 11:03:09,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886909690] [2019-11-22 11:03:09,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170173787] [2019-11-22 11:03:09,943 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 11:03:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 11:03:09,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:10,370 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 11:03:10,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:10,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-22 11:03:10,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752677445] [2019-11-22 11:03:10,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 11:03:10,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 11:03:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:03:10,372 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 27 states. [2019-11-22 11:03:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:13,310 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-11-22 11:03:13,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-22 11:03:13,311 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-22 11:03:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:13,316 INFO L225 Difference]: With dead ends: 187 [2019-11-22 11:03:13,317 INFO L226 Difference]: Without dead ends: 187 [2019-11-22 11:03:13,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=475, Invalid=2495, Unknown=0, NotChecked=0, Total=2970 [2019-11-22 11:03:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-22 11:03:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-11-22 11:03:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-22 11:03:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-11-22 11:03:13,341 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 32 [2019-11-22 11:03:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:13,341 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-22 11:03:13,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 11:03:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-11-22 11:03:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:03:13,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:13,343 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 11:03:13,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:13,547 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:13,548 INFO L82 PathProgramCache]: Analyzing trace with hash -997384011, now seen corresponding path program 1 times [2019-11-22 11:03:13,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:13,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261495238] [2019-11-22 11:03:13,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:13,760 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 11:03:13,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261495238] [2019-11-22 11:03:13,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007690669] [2019-11-22 11:03:13,761 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 11:03:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:13,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:03:13,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:13,871 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 11:03:13,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:13,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:13,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:13,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 11:03:14,293 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 11:03:14,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:14,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 11:03:14,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157433993] [2019-11-22 11:03:14,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 11:03:14,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 11:03:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:03:14,296 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 21 states. [2019-11-22 11:03:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:16,349 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2019-11-22 11:03:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 11:03:16,350 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-22 11:03:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:16,352 INFO L225 Difference]: With dead ends: 210 [2019-11-22 11:03:16,353 INFO L226 Difference]: Without dead ends: 210 [2019-11-22 11:03:16,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2019-11-22 11:03:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-22 11:03:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2019-11-22 11:03:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-22 11:03:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2019-11-22 11:03:16,374 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 33 [2019-11-22 11:03:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:16,375 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2019-11-22 11:03:16,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 11:03:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2019-11-22 11:03:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 11:03:16,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:16,378 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 11:03:16,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:16,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1094393214, now seen corresponding path program 1 times [2019-11-22 11:03:16,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:16,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653493682] [2019-11-22 11:03:16,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,817 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 11:03:16,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653493682] [2019-11-22 11:03:16,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890645964] [2019-11-22 11:03:16,818 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 11:03:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:03:16,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:16,889 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 11:03:16,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:16,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:16,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:16,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-22 11:03:19,023 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 11:03:19,133 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 11:03:19,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:19,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:19,138 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 11:03:19,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-22 11:03:19,168 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 11:03:19,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:19,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-22 11:03:19,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072491789] [2019-11-22 11:03:19,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:03:19,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:19,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:03:19,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-22 11:03:19,170 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 10 states. [2019-11-22 11:03:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:19,362 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-22 11:03:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:03:19,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-22 11:03:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:19,364 INFO L225 Difference]: With dead ends: 85 [2019-11-22 11:03:19,365 INFO L226 Difference]: Without dead ends: 85 [2019-11-22 11:03:19,365 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 11:03:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-22 11:03:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-22 11:03:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-22 11:03:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-22 11:03:19,370 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 32 [2019-11-22 11:03:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:19,370 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-22 11:03:19,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:03:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-22 11:03:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 11:03:19,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:19,372 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 11:03:19,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:19,576 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash -854133297, now seen corresponding path program 1 times [2019-11-22 11:03:19,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:19,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140584591] [2019-11-22 11:03:19,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,747 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 11:03:19,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140584591] [2019-11-22 11:03:19,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857425416] [2019-11-22 11:03:19,748 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 11:03:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:03:19,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:19,815 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 11:03:19,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:19,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:19,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:19,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 11:03:20,370 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 11:03:20,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:20,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 11:03:20,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596701391] [2019-11-22 11:03:20,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 11:03:20,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 11:03:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:03:20,373 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2019-11-22 11:03:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:21,831 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-11-22 11:03:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 11:03:21,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-22 11:03:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:21,833 INFO L225 Difference]: With dead ends: 93 [2019-11-22 11:03:21,833 INFO L226 Difference]: Without dead ends: 93 [2019-11-22 11:03:21,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 11:03:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-22 11:03:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-22 11:03:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-22 11:03:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-22 11:03:21,838 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2019-11-22 11:03:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:21,838 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-22 11:03:21,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 11:03:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-22 11:03:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 11:03:21,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:21,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:22,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:22,044 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1410938279, now seen corresponding path program 1 times [2019-11-22 11:03:22,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:22,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381632436] [2019-11-22 11:03:22,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 11:03:22,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381632436] [2019-11-22 11:03:22,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872494358] [2019-11-22 11:03:22,482 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 11:03:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-22 11:03:22,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:22,551 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 11:03:22,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:22,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:22,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:22,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 11:03:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 11:03:23,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:23,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2019-11-22 11:03:23,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342276824] [2019-11-22 11:03:23,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 11:03:23,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:23,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 11:03:23,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-11-22 11:03:23,171 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 32 states. [2019-11-22 11:03:24,687 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-22 11:03:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:25,401 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-22 11:03:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-22 11:03:25,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-11-22 11:03:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:25,402 INFO L225 Difference]: With dead ends: 91 [2019-11-22 11:03:25,402 INFO L226 Difference]: Without dead ends: 67 [2019-11-22 11:03:25,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2019-11-22 11:03:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-22 11:03:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-22 11:03:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 11:03:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-22 11:03:25,408 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 45 [2019-11-22 11:03:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:25,409 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-22 11:03:25,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 11:03:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-22 11:03:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 11:03:25,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:25,410 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 11:03:25,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:25,614 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:25,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1674201326, now seen corresponding path program 1 times [2019-11-22 11:03:25,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:25,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606269617] [2019-11-22 11:03:25,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:25,964 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 11:03:25,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606269617] [2019-11-22 11:03:25,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984692596] [2019-11-22 11:03:25,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:26,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-22 11:03:26,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:26,398 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 11:03:26,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:26,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-22 11:03:26,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280050278] [2019-11-22 11:03:26,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 11:03:26,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 11:03:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-22 11:03:26,401 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-22 11:03:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:28,638 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 11:03:28,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 11:03:28,638 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-22 11:03:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:28,639 INFO L225 Difference]: With dead ends: 66 [2019-11-22 11:03:28,639 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:03:28,641 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 11:03:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:03:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:03:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:03:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:03:28,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-22 11:03:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:28,643 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:03:28,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 11:03:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:03:28,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:03:28,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:28,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:03:28 BoogieIcfgContainer [2019-11-22 11:03:28,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:03:28,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:03:28,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:03:28,852 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:03:28,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:00" (3/4) ... [2019-11-22 11:03:28,856 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:03:28,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:03:28,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:03:28,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 11:03:28,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 11:03:28,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 11:03:28,868 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-22 11:03:28,868 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 11:03:28,869 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 11:03:28,869 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:03:28,920 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:03:28,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:03:28,925 INFO L168 Benchmark]: Toolchain (without parser) took 29646.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 400.6 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -215.4 MB). Peak memory consumption was 185.1 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:28,925 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 11:03:28,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:28,930 INFO L168 Benchmark]: Boogie Preprocessor took 61.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:28,930 INFO L168 Benchmark]: RCFGBuilder took 469.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:28,931 INFO L168 Benchmark]: TraceAbstraction took 28606.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 293.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.6 MB). Peak memory consumption was 190.4 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:28,932 INFO L168 Benchmark]: Witness Printer took 70.90 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 11:03:28,934 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 433.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 469.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28606.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 293.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.6 MB). Peak memory consumption was 190.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.90 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: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 16 error locations. Result: SAFE, OverallTime: 28.5s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 511 SDtfs, 2284 SDslu, 1187 SDs, 0 SdLazy, 7256 SolverSat, 1128 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 291 SyntacticMatches, 14 SemanticMatches, 364 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 220 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 682 ConstructedInterpolants, 68 QuantifiedInterpolants, 185721 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 59/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...