./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 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-6692e4f [2019-11-25 17:25:45,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:25:45,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:25:45,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:25:45,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:25:45,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:25:45,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:25:45,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:25:45,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:25:45,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:25:45,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:25:45,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:25:45,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:25:45,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:25:45,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:25:45,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:25:45,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:25:45,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:25:45,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:25:45,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:25:45,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:25:45,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:25:45,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:25:45,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:25:45,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:25:45,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:25:45,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:25:45,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:25:45,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:25:45,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:25:45,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:25:45,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:25:45,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:25:45,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:25:45,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:25:45,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:25:45,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:25:45,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:25:45,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:25:45,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:25:45,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:25:45,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:25:45,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:25:45,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:25:45,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:25:45,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:25:45,512 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:25:45,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:25:45,513 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:25:45,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:25:45,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:25:45,513 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:25:45,514 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:25:45,514 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:25:45,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:25:45,514 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:25:45,515 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:25:45,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:25:45,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:25:45,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:25:45,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:25:45,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:25:45,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:25:45,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:25:45,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:25:45,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:25:45,517 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-25 17:25:45,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:25:45,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:25:45,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:25:45,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:25:45,861 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:25:45,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-25 17:25:45,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e2503b3/5af21dd2d2a34c4693af349040e5f903/FLAG8bb7fbaa3 [2019-11-25 17:25:46,383 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:25:46,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-25 17:25:46,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e2503b3/5af21dd2d2a34c4693af349040e5f903/FLAG8bb7fbaa3 [2019-11-25 17:25:46,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e2503b3/5af21dd2d2a34c4693af349040e5f903 [2019-11-25 17:25:46,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:25:46,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:25:46,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:25:46,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:25:46,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:25:46,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:25:46" (1/1) ... [2019-11-25 17:25:46,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68bf092e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:46, skipping insertion in model container [2019-11-25 17:25:46,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:25:46" (1/1) ... [2019-11-25 17:25:46,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:25:46,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:25:47,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:25:47,057 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:25:47,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:25:47,093 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:25:47,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47 WrapperNode [2019-11-25 17:25:47,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:25:47,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:25:47,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:25:47,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:25:47,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... [2019-11-25 17:25:47,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:25:47,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:25:47,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:25:47,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:25:47,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:25:47,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:25:47,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:25:47,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:25:47,248 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-25 17:25:47,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:25:47,248 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:25:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:25:47,248 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:25:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:25:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:25:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:25:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:25:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-25 17:25:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:25:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:25:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:25:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:25:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:25:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:25:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:25:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:25:47,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:25:47,655 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-25 17:25:47,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:47 BoogieIcfgContainer [2019-11-25 17:25:47,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:25:47,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:25:47,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:25:47,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:25:47,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:25:46" (1/3) ... [2019-11-25 17:25:47,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69799c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:25:47, skipping insertion in model container [2019-11-25 17:25:47,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:47" (2/3) ... [2019-11-25 17:25:47,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69799c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:25:47, skipping insertion in model container [2019-11-25 17:25:47,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:47" (3/3) ... [2019-11-25 17:25:47,665 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2019-11-25 17:25:47,675 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:25:47,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 17:25:47,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 17:25:47,715 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:25:47,715 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:25:47,715 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:25:47,716 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:25:47,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:25:47,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:25:47,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:25:47,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:25:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-25 17:25:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:25:47,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:47,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:47,744 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957205, now seen corresponding path program 1 times [2019-11-25 17:25:47,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:47,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598254253] [2019-11-25 17:25:47,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:48,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598254253] [2019-11-25 17:25:48,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:48,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:25:48,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242897417] [2019-11-25 17:25:48,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:25:48,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:25:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:25:48,066 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2019-11-25 17:25:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:48,439 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-25 17:25:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:25:48,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-25 17:25:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:48,452 INFO L225 Difference]: With dead ends: 59 [2019-11-25 17:25:48,452 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 17:25:48,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:25:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 17:25:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-25 17:25:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 17:25:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-25 17:25:48,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 18 [2019-11-25 17:25:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:48,505 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-25 17:25:48,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:25:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-25 17:25:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:25:48,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:48,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:48,508 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:48,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957204, now seen corresponding path program 1 times [2019-11-25 17:25:48,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:48,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160116629] [2019-11-25 17:25:48,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:48,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160116629] [2019-11-25 17:25:48,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:48,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:25:48,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584334140] [2019-11-25 17:25:48,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:48,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:48,698 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2019-11-25 17:25:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:49,028 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-25 17:25:49,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:25:49,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-25 17:25:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:49,031 INFO L225 Difference]: With dead ends: 54 [2019-11-25 17:25:49,031 INFO L226 Difference]: Without dead ends: 54 [2019-11-25 17:25:49,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:25:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-25 17:25:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-25 17:25:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 17:25:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-25 17:25:49,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2019-11-25 17:25:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:49,043 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-25 17:25:49,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-25 17:25:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 17:25:49,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:49,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:49,045 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2036436141, now seen corresponding path program 1 times [2019-11-25 17:25:49,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:49,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235682527] [2019-11-25 17:25:49,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:49,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235682527] [2019-11-25 17:25:49,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:49,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 17:25:49,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384043046] [2019-11-25 17:25:49,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:25:49,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:49,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:25:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:49,350 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-11-25 17:25:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:49,935 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-25 17:25:49,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:25:49,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-25 17:25:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:49,941 INFO L225 Difference]: With dead ends: 82 [2019-11-25 17:25:49,941 INFO L226 Difference]: Without dead ends: 82 [2019-11-25 17:25:49,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:25:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-25 17:25:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-25 17:25:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:25:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-25 17:25:49,953 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 20 [2019-11-25 17:25:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:49,954 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-25 17:25:49,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:25:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-25 17:25:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:25:49,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:49,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:49,956 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818779, now seen corresponding path program 1 times [2019-11-25 17:25:49,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:49,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320714474] [2019-11-25 17:25:49,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:50,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320714474] [2019-11-25 17:25:50,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:50,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:25:50,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974498364] [2019-11-25 17:25:50,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:25:50,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:25:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:25:50,133 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2019-11-25 17:25:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:50,423 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-25 17:25:50,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:25:50,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 17:25:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:50,425 INFO L225 Difference]: With dead ends: 56 [2019-11-25 17:25:50,425 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 17:25:50,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:25:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 17:25:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-25 17:25:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 17:25:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-11-25 17:25:50,433 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 21 [2019-11-25 17:25:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:50,433 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-25 17:25:50,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:25:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-11-25 17:25:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:25:50,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:50,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:50,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818778, now seen corresponding path program 1 times [2019-11-25 17:25:50,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:50,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325671141] [2019-11-25 17:25:50,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:50,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325671141] [2019-11-25 17:25:50,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:50,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:25:50,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638497698] [2019-11-25 17:25:50,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:25:50,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:50,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:25:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:25:50,710 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-11-25 17:25:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:51,424 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-25 17:25:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:25:51,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-25 17:25:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:51,428 INFO L225 Difference]: With dead ends: 90 [2019-11-25 17:25:51,429 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 17:25:51,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:25:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 17:25:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2019-11-25 17:25:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 17:25:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-25 17:25:51,450 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 21 [2019-11-25 17:25:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:51,451 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-25 17:25:51,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:25:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-25 17:25:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:25:51,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:51,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:51,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash -486807298, now seen corresponding path program 1 times [2019-11-25 17:25:51,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:51,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974389051] [2019-11-25 17:25:51,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,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-25 17:25:51,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974389051] [2019-11-25 17:25:51,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:51,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:25:51,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051997489] [2019-11-25 17:25:51,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:25:51,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:25:51,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:25:51,678 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 10 states. [2019-11-25 17:25:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:52,267 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-25 17:25:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:25:52,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-25 17:25:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:52,269 INFO L225 Difference]: With dead ends: 87 [2019-11-25 17:25:52,269 INFO L226 Difference]: Without dead ends: 87 [2019-11-25 17:25:52,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:25:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-25 17:25:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2019-11-25 17:25:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 17:25:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-25 17:25:52,278 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 22 [2019-11-25 17:25:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:52,279 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-25 17:25:52,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:25:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-25 17:25:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 17:25:52,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:52,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:52,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1532204726, now seen corresponding path program 1 times [2019-11-25 17:25:52,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:52,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971622809] [2019-11-25 17:25:52,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:52,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971622809] [2019-11-25 17:25:52,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:52,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:25:52,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486396933] [2019-11-25 17:25:52,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:25:52,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:25:52,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:25:52,345 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2019-11-25 17:25:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:52,508 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-11-25 17:25:52,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:25:52,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-25 17:25:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:52,511 INFO L225 Difference]: With dead ends: 73 [2019-11-25 17:25:52,511 INFO L226 Difference]: Without dead ends: 73 [2019-11-25 17:25:52,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:25:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-25 17:25:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-25 17:25:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 17:25:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-11-25 17:25:52,528 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 28 [2019-11-25 17:25:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:52,528 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-11-25 17:25:52,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:25:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-11-25 17:25:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:25:52,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:52,530 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:52,531 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1010784573, now seen corresponding path program 1 times [2019-11-25 17:25:52,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:52,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638869920] [2019-11-25 17:25:52,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:52,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638869920] [2019-11-25 17:25:52,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285786061] [2019-11-25 17:25:52,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:25:52,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:53,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-25 17:25:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7419002] [2019-11-25 17:25:53,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 17:25:53,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 17:25:53,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:25:53,062 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 17 states. [2019-11-25 17:25:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:56,615 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2019-11-25 17:25:56,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 17:25:56,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-25 17:25:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:56,619 INFO L225 Difference]: With dead ends: 135 [2019-11-25 17:25:56,619 INFO L226 Difference]: Without dead ends: 135 [2019-11-25 17:25:56,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-25 17:25:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-25 17:25:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2019-11-25 17:25:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-25 17:25:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-11-25 17:25:56,635 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 30 [2019-11-25 17:25:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:56,635 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-11-25 17:25:56,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 17:25:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-11-25 17:25:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:25:56,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:56,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:56,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:56,841 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash -725039271, now seen corresponding path program 1 times [2019-11-25 17:25:56,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:56,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834725202] [2019-11-25 17:25:56,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:56,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-25 17:25:56,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834725202] [2019-11-25 17:25:56,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:56,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:25:56,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975492255] [2019-11-25 17:25:56,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:56,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:56,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:56,937 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 7 states. [2019-11-25 17:25:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:57,169 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2019-11-25 17:25:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:25:57,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-25 17:25:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:57,176 INFO L225 Difference]: With dead ends: 108 [2019-11-25 17:25:57,176 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 17:25:57,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 17:25:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-25 17:25:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-25 17:25:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-11-25 17:25:57,206 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 30 [2019-11-25 17:25:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:57,206 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-11-25 17:25:57,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-11-25 17:25:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:25:57,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:57,210 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:57,211 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:25:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -701366204, now seen corresponding path program 1 times [2019-11-25 17:25:57,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:57,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731379064] [2019-11-25 17:25:57,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:57,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731379064] [2019-11-25 17:25:57,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855542323] [2019-11-25 17:25:57,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:57,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 17:25:57,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:57,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:57,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-25 17:25:57,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192674640] [2019-11-25 17:25:57,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-25 17:25:57,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-25 17:25:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:25:57,924 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 27 states. [2019-11-25 17:26:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:00,983 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-11-25 17:26:00,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-25 17:26:00,984 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-25 17:26:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:00,987 INFO L225 Difference]: With dead ends: 187 [2019-11-25 17:26:00,987 INFO L226 Difference]: Without dead ends: 187 [2019-11-25 17:26:00,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=475, Invalid=2495, Unknown=0, NotChecked=0, Total=2970 [2019-11-25 17:26:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-25 17:26:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-11-25 17:26:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-25 17:26:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-11-25 17:26:01,001 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 32 [2019-11-25 17:26:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:01,001 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-25 17:26:01,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-25 17:26:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-11-25 17:26:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:26:01,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:01,003 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:01,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:01,213 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash -997384011, now seen corresponding path program 1 times [2019-11-25 17:26:01,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:01,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470859380] [2019-11-25 17:26:01,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:26:01,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470859380] [2019-11-25 17:26:01,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394311843] [2019-11-25 17:26:01,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:01,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:26:01,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:01,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:26:01,485 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:01,498 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:01,498 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:01,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:01,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:01,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-25 17:26:01,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630879695] [2019-11-25 17:26:01,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 17:26:01,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 17:26:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:26:01,903 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 21 states. [2019-11-25 17:26:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:04,038 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2019-11-25 17:26:04,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 17:26:04,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-25 17:26:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:04,041 INFO L225 Difference]: With dead ends: 210 [2019-11-25 17:26:04,041 INFO L226 Difference]: Without dead ends: 210 [2019-11-25 17:26:04,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2019-11-25 17:26:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-25 17:26:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2019-11-25 17:26:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 17:26:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2019-11-25 17:26:04,053 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 33 [2019-11-25 17:26:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:04,053 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2019-11-25 17:26:04,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 17:26:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2019-11-25 17:26:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:26:04,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:04,054 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:04,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:04,262 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1094393214, now seen corresponding path program 1 times [2019-11-25 17:26:04,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:04,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217820555] [2019-11-25 17:26:04,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:04,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217820555] [2019-11-25 17:26:04,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735921823] [2019-11-25 17:26:04,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:04,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:26:04,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:04,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-11-25 17:26:04,589 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:04,595 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:04,595 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:04,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-25 17:26:06,730 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-25 17:26:06,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-11-25 17:26:06,803 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:06,811 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:06,812 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:06,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-25 17:26:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:06,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:26:06,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-25 17:26:06,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283947536] [2019-11-25 17:26:06,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:26:06,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:26:06,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-25 17:26:06,840 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 10 states. [2019-11-25 17:26:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:07,059 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-25 17:26:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:26:07,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-25 17:26:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:07,061 INFO L225 Difference]: With dead ends: 85 [2019-11-25 17:26:07,061 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 17:26:07,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-11-25 17:26:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 17:26:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-25 17:26:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-25 17:26:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-25 17:26:07,067 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 32 [2019-11-25 17:26:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:07,067 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-25 17:26:07,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:26:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-25 17:26:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:26:07,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:07,068 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:07,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:07,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash -854133297, now seen corresponding path program 1 times [2019-11-25 17:26:07,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:07,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491161291] [2019-11-25 17:26:07,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:26:07,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491161291] [2019-11-25 17:26:07,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201813274] [2019-11-25 17:26:07,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:07,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:26:07,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:07,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:26:07,535 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:07,548 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:07,549 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:07,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:07,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:07,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-25 17:26:07,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69456708] [2019-11-25 17:26:07,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 17:26:07,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:07,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 17:26:07,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:26:07,923 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2019-11-25 17:26:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:09,489 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-11-25 17:26:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:26:09,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-25 17:26:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:09,490 INFO L225 Difference]: With dead ends: 93 [2019-11-25 17:26:09,492 INFO L226 Difference]: Without dead ends: 93 [2019-11-25 17:26:09,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 17:26:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-25 17:26:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-25 17:26:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-25 17:26:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-25 17:26:09,498 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2019-11-25 17:26:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:09,499 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-25 17:26:09,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 17:26:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-25 17:26:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 17:26:09,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:09,501 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:09,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:09,706 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1410938279, now seen corresponding path program 1 times [2019-11-25 17:26:09,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:09,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096094836] [2019-11-25 17:26:09,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:26:10,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096094836] [2019-11-25 17:26:10,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084965910] [2019-11-25 17:26:10,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:10,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-25 17:26:10,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:10,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:26:10,329 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:10,333 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,333 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:10,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:26:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:26:10,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:10,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2019-11-25 17:26:10,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781430022] [2019-11-25 17:26:10,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 17:26:10,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 17:26:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-11-25 17:26:10,873 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 32 states. [2019-11-25 17:26:12,440 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-25 17:26:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:13,162 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-25 17:26:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-25 17:26:13,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-11-25 17:26:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:13,163 INFO L225 Difference]: With dead ends: 91 [2019-11-25 17:26:13,164 INFO L226 Difference]: Without dead ends: 67 [2019-11-25 17:26:13,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2019-11-25 17:26:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-25 17:26:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-25 17:26:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:26:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-25 17:26:13,168 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 45 [2019-11-25 17:26:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:13,169 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-25 17:26:13,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 17:26:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-25 17:26:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 17:26:13,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:13,171 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:13,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:13,374 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-25 17:26:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1674201326, now seen corresponding path program 1 times [2019-11-25 17:26:13,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:26:13,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327292107] [2019-11-25 17:26:13,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:26:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-25 17:26:13,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327292107] [2019-11-25 17:26:13,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909994271] [2019-11-25 17:26:13,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:13,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-25 17:26:13,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 17:26:14,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:14,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-25 17:26:14,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681366536] [2019-11-25 17:26:14,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 17:26:14,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:26:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 17:26:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-25 17:26:14,177 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-25 17:26:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:16,434 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-25 17:26:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-25 17:26:16,435 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-25 17:26:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:16,435 INFO L225 Difference]: With dead ends: 66 [2019-11-25 17:26:16,435 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:26:16,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-25 17:26:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:26:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:26:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:26:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:26:16,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-25 17:26:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:16,438 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:26:16,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 17:26:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:26:16,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:26:16,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:16,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:26:16 BoogieIcfgContainer [2019-11-25 17:26:16,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:26:16,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:26:16,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:26:16,647 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:26:16,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:47" (3/4) ... [2019-11-25 17:26:16,650 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:26:16,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:26:16,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:26:16,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:26:16,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-25 17:26:16,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:26:16,664 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-25 17:26:16,664 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:26:16,665 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 17:26:16,665 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:26:16,724 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:26:16,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:26:16,726 INFO L168 Benchmark]: Toolchain (without parser) took 29926.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -77.5 MB). Peak memory consumption was 339.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:16,726 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:26:16,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:16,727 INFO L168 Benchmark]: Boogie Preprocessor took 95.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:16,728 INFO L168 Benchmark]: RCFGBuilder took 466.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:16,728 INFO L168 Benchmark]: TraceAbstraction took 28988.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 281.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 334.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:16,729 INFO L168 Benchmark]: Witness Printer took 77.91 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:16,731 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.26 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 293.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 466.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28988.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 281.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 334.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.91 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 16 error locations. Result: SAFE, OverallTime: 28.9s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 511 SDtfs, 2284 SDslu, 1187 SDs, 0 SdLazy, 7256 SolverSat, 1128 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 291 SyntacticMatches, 14 SemanticMatches, 364 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 220 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 682 ConstructedInterpolants, 68 QuantifiedInterpolants, 185721 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 59/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...