./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17d20a29a9e9cc6560e9aa0daac36f5de29f992c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:06:45,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:06:45,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:06:45,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:06:45,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:06:45,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:06:45,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:06:45,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:06:45,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:06:45,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:06:45,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:06:45,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:06:45,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:06:45,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:06:45,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:06:45,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:06:45,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:06:45,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:06:45,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:06:45,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:06:45,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:06:45,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:06:45,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:06:45,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:06:45,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:06:45,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:06:45,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:06:45,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:06:45,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:06:45,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:06:45,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:06:45,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:06:45,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:06:45,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:06:45,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:06:45,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:06:45,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:06:45,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:06:45,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:06:45,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:06:45,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:06:45,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:06:45,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:06:45,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:06:45,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:06:45,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:06:45,528 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:06:45,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:06:45,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:06:45,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:06:45,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:06:45,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:06:45,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:06:45,530 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:06:45,531 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:06:45,531 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:06:45,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:06:45,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:06:45,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:06:45,532 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:06:45,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:06:45,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:06:45,533 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:06:45,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:06:45,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:06:45,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:06:45,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:06:45,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:06:45,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:06:45,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:06:45,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17d20a29a9e9cc6560e9aa0daac36f5de29f992c [2019-11-28 20:06:45,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:06:45,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:06:45,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:06:45,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:06:45,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:06:45,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-28 20:06:45,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3d6d468/81396de6b29c411abb4af475f94fe778/FLAGe5d0dba2a [2019-11-28 20:06:46,369 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:06:46,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-28 20:06:46,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3d6d468/81396de6b29c411abb4af475f94fe778/FLAGe5d0dba2a [2019-11-28 20:06:46,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3d6d468/81396de6b29c411abb4af475f94fe778 [2019-11-28 20:06:46,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:06:46,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:06:46,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:46,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:06:46,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:06:46,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:46" (1/1) ... [2019-11-28 20:06:46,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b116752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:46, skipping insertion in model container [2019-11-28 20:06:46,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:46" (1/1) ... [2019-11-28 20:06:46,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:06:46,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:06:46,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:46,967 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:06:46,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:47,002 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:06:47,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47 WrapperNode [2019-11-28 20:06:47,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:47,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:06:47,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:06:47,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:06:47,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (1/1) ... [2019-11-28 20:06:47,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:06:47,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:06:47,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:06:47,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:06:47,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06: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-28 20:06:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:06:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:06:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 20:06:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-28 20:06:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:06:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 20:06:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:06:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:06:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:06:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 20:06:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 20:06:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:06:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-28 20:06:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:06:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:06:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:06:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 20:06:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:06:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:06:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:06:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:06:47,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:06:47,481 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 20:06:47,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:47 BoogieIcfgContainer [2019-11-28 20:06:47,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:06:47,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:06:47,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:06:47,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:06:47,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:06:46" (1/3) ... [2019-11-28 20:06:47,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f18b905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:47, skipping insertion in model container [2019-11-28 20:06:47,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:47" (2/3) ... [2019-11-28 20:06:47,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f18b905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:47, skipping insertion in model container [2019-11-28 20:06:47,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:47" (3/3) ... [2019-11-28 20:06:47,491 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-11-28 20:06:47,500 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:06:47,507 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-28 20:06:47,519 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-28 20:06:47,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:06:47,540 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:06:47,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:06:47,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:06:47,541 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:06:47,541 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:06:47,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:06:47,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:06:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-28 20:06:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:06:47,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:47,571 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-28 20:06:47,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-11-28 20:06:47,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:47,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241503970] [2019-11-28 20:06:47,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,908 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-28 20:06:47,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241503970] [2019-11-28 20:06:47,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:47,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:06:47,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331927808] [2019-11-28 20:06:47,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:06:47,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:06:47,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:06:47,938 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-28 20:06:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:48,230 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-28 20:06:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:48,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-28 20:06:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:48,248 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:06:48,248 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:06:48,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:06:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 20:06:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:06:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-28 20:06:48,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-11-28 20:06:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:48,311 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-28 20:06:48,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:06:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-28 20:06:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:06:48,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:48,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:48,315 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-11-28 20:06:48,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:48,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416432488] [2019-11-28 20:06:48,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,480 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-28 20:06:48,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416432488] [2019-11-28 20:06:48,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:48,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:06:48,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497593504] [2019-11-28 20:06:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:06:48,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:06:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:06:48,491 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-28 20:06:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:48,725 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-28 20:06:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:06:48,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-28 20:06:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:48,729 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:06:48,729 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 20:06:48,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 20:06:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 20:06:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:06:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-28 20:06:48,744 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-11-28 20:06:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:48,745 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-28 20:06:48,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:06:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-28 20:06:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:06:48,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:48,749 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-28 20:06:48,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-11-28 20:06:48,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:48,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717225742] [2019-11-28 20:06:48,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,834 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-28 20:06:48,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717225742] [2019-11-28 20:06:48,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:48,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:06:48,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798074566] [2019-11-28 20:06:48,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:06:48,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:06:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:06:48,839 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-11-28 20:06:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:49,054 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 20:06:49,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:06:49,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 20:06:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:49,057 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:06:49,057 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:06:49,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:06:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 20:06:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:06:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-28 20:06:49,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-28 20:06:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:49,072 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-28 20:06:49,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:06:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-28 20:06:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:06:49,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:49,074 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-28 20:06:49,076 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-11-28 20:06:49,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:49,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702795915] [2019-11-28 20:06:49,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,214 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-28 20:06:49,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702795915] [2019-11-28 20:06:49,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:49,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:49,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694261801] [2019-11-28 20:06:49,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:49,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:49,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:49,218 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-11-28 20:06:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:49,481 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-28 20:06:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:06:49,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 20:06:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:49,482 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:06:49,482 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:06:49,483 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-28 20:06:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:06:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:06:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:06:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 20:06:49,492 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-11-28 20:06:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:49,492 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 20:06:49,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 20:06:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:06:49,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:49,496 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-28 20:06:49,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-11-28 20:06:49,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:49,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120036818] [2019-11-28 20:06:49,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,689 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-28 20:06:49,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120036818] [2019-11-28 20:06:49,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:49,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:06:49,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321182308] [2019-11-28 20:06:49,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:06:49,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:06:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:49,693 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-11-28 20:06:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:50,232 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-28 20:06:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:06:50,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-28 20:06:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:50,246 INFO L225 Difference]: With dead ends: 77 [2019-11-28 20:06:50,246 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 20:06:50,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:06:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 20:06:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-28 20:06:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:06:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-28 20:06:50,262 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-11-28 20:06:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:50,262 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-28 20:06:50,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:06:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-28 20:06:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:06:50,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:50,266 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-28 20:06:50,267 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-11-28 20:06:50,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:50,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263585935] [2019-11-28 20:06:50,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,420 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-28 20:06:50,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263585935] [2019-11-28 20:06:50,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:50,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:06:50,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135398174] [2019-11-28 20:06:50,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:50,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:50,427 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-11-28 20:06:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:50,621 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-28 20:06:50,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:06:50,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 20:06:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:50,623 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:06:50,623 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:06:50,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:06:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 20:06:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 20:06:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-28 20:06:50,630 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-28 20:06:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:50,630 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-28 20:06:50,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-28 20:06:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:06:50,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:50,632 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-28 20:06:50,632 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-11-28 20:06:50,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:50,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381562966] [2019-11-28 20:06:50,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,789 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-28 20:06:50,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381562966] [2019-11-28 20:06:50,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:50,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:06:50,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352270453] [2019-11-28 20:06:50,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:06:50,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:06:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:50,791 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-11-28 20:06:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:51,288 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-28 20:06:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:06:51,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 20:06:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:51,290 INFO L225 Difference]: With dead ends: 68 [2019-11-28 20:06:51,290 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:06:51,294 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-28 20:06:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:06:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-11-28 20:06:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 20:06:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-28 20:06:51,308 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-11-28 20:06:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:51,308 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-28 20:06:51,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:06:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-28 20:06:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:06:51,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:51,312 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-28 20:06:51,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-11-28 20:06:51,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:51,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103091609] [2019-11-28 20:06:51,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,500 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-28 20:06:51,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103091609] [2019-11-28 20:06:51,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143467318] [2019-11-28 20:06:51,501 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-28 20:06:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:06:51,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:51,812 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-28 20:06:51,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:51,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-28 20:06:51,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858428787] [2019-11-28 20:06:51,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:06:51,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:51,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:06:51,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:06:51,817 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-11-28 20:06:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:52,953 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-11-28 20:06:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 20:06:52,954 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-28 20:06:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:52,955 INFO L225 Difference]: With dead ends: 80 [2019-11-28 20:06:52,955 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 20:06:52,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 20:06:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 20:06:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-28 20:06:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:06:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-28 20:06:52,964 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-11-28 20:06:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:52,965 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-28 20:06:52,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:06:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-28 20:06:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:06:52,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:52,967 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-28 20:06:53,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:53,172 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-11-28 20:06:53,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:53,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819441801] [2019-11-28 20:06:53,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,435 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-28 20:06:53,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819441801] [2019-11-28 20:06:53,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702414230] [2019-11-28 20:06:53,436 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-28 20:06:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 20:06:53,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:53,921 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-28 20:06:53,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:53,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-28 20:06:53,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095871103] [2019-11-28 20:06:53,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 20:06:53,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 20:06:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-28 20:06:53,924 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-11-28 20:06:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:58,526 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-28 20:06:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 20:06:58,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-28 20:06:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:58,529 INFO L225 Difference]: With dead ends: 110 [2019-11-28 20:06:58,529 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 20:06:58,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 20:06:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 20:06:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-11-28 20:06:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 20:06:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-28 20:06:58,542 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-11-28 20:06:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:58,543 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-28 20:06:58,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 20:06:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-28 20:06:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 20:06:58,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:58,545 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-28 20:06:58,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:58,749 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-11-28 20:06:58,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:58,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001130217] [2019-11-28 20:06:58,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:58,930 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-28 20:06:58,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001130217] [2019-11-28 20:06:58,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502409241] [2019-11-28 20:06:58,931 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-28 20:06:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:59,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:06:59,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:59,047 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-28 20:06:59,047 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:59,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:59,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:59,057 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:06:59,422 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-28 20:06:59,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:59,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 20:06:59,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076403327] [2019-11-28 20:06:59,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:06:59,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:06:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:06:59,425 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-11-28 20:07:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:01,119 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-11-28 20:07:01,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:07:01,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-28 20:07:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:01,122 INFO L225 Difference]: With dead ends: 115 [2019-11-28 20:07:01,122 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 20:07:01,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 20:07:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 20:07:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-11-28 20:07:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 20:07:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-28 20:07:01,132 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-11-28 20:07:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:01,133 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-28 20:07:01,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:07:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-28 20:07:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:07:01,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:01,134 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-28 20:07:01,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:01,338 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-11-28 20:07:01,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:01,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189856064] [2019-11-28 20:07:01,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:01,577 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-28 20:07:01,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189856064] [2019-11-28 20:07:01,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569071680] [2019-11-28 20:07:01,578 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-28 20:07:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:01,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:07:01,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:01,646 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-28 20:07:01,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:01,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:01,650 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:01,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-28 20:07:03,789 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-28 20:07:03,900 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-28 20:07:03,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:03,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:03,907 INFO L534 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-28 20:07:03,907 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-28 20:07:03,946 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-28 20:07:03,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:07:03,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-28 20:07:03,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854175790] [2019-11-28 20:07:03,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:07:03,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:03,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:07:03,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-28 20:07:03,949 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-11-28 20:07:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:04,101 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-28 20:07:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:07:04,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-28 20:07:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:04,103 INFO L225 Difference]: With dead ends: 83 [2019-11-28 20:07:04,103 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 20:07:04,103 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-28 20:07:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 20:07:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-28 20:07:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 20:07:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-28 20:07:04,112 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-11-28 20:07:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:04,114 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-28 20:07:04,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:07:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-28 20:07:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:07:04,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:04,117 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-28 20:07:04,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:04,323 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-11-28 20:07:04,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:04,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67687476] [2019-11-28 20:07:04,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,494 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-28 20:07:04,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67687476] [2019-11-28 20:07:04,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439738455] [2019-11-28 20:07:04,495 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-28 20:07:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:07:04,550 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:04,560 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-28 20:07:04,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:04,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:04,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:04,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:07:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:04,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:04,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 20:07:04,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010903585] [2019-11-28 20:07:04,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:07:04,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:07:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:04,929 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-11-28 20:07:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:06,062 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 20:07:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:07:06,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-28 20:07:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:06,064 INFO L225 Difference]: With dead ends: 63 [2019-11-28 20:07:06,064 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 20:07:06,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 20:07:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 20:07:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-28 20:07:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:07:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-28 20:07:06,070 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-11-28 20:07:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:06,070 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-28 20:07:06,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:07:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-28 20:07:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 20:07:06,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:06,073 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-28 20:07:06,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:06,282 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:06,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:06,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-11-28 20:07:06,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:06,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513966499] [2019-11-28 20:07:06,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,643 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-28 20:07:06,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513966499] [2019-11-28 20:07:06,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994342112] [2019-11-28 20:07:06,644 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-28 20:07:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 20:07:06,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:07,066 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-28 20:07:07,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:07,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-28 20:07:07,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581039452] [2019-11-28 20:07:07,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 20:07:07,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 20:07:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:07:07,068 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-28 20:07:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:09,177 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-28 20:07:09,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 20:07:09,178 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-28 20:07:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:09,178 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:07:09,178 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:07:09,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 20:07:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:07:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:07:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:07:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:07:09,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-28 20:07:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:09,181 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:07:09,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 20:07:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:07:09,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:07:09,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:09,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:09 BoogieIcfgContainer [2019-11-28 20:07:09,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:09,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:09,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:09,390 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:09,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:47" (3/4) ... [2019-11-28 20:07:09,394 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:07:09,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:07:09,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:07:09,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-28 20:07:09,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-28 20:07:09,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 20:07:09,405 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 20:07:09,405 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 20:07:09,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:07:09,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:07:09,460 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:07:09,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:09,464 INFO L168 Benchmark]: Toolchain (without parser) took 22711.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.5 MB). Free memory was 959.0 MB in the beginning and 1.2 GB in the end (delta: -220.3 MB). Peak memory consumption was 125.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:09,468 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-28 20:07:09,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:09,469 INFO L168 Benchmark]: Boogie Preprocessor took 89.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:09,469 INFO L168 Benchmark]: RCFGBuilder took 389.82 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.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:09,470 INFO L168 Benchmark]: TraceAbstraction took 21905.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.5 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:09,471 INFO L168 Benchmark]: Witness Printer took 73.20 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:09,476 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 248.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.82 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.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21905.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.5 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.20 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 12 error locations. Result: SAFE, OverallTime: 21.8s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1965 SDslu, 712 SDs, 0 SdLazy, 4878 SolverSat, 989 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 247 SyntacticMatches, 11 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 32 QuantifiedInterpolants, 129907 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1012 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 49/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...