./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max.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 2e9d0e89ee237165e6cd15cb730148b321ca31eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:58:10,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:58:10,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:58:10,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:58:10,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:58:10,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:58:10,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:58:10,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:58:10,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:58:10,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:58:10,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:58:10,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:58:10,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:58:10,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:58:10,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:58:10,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:58:10,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:58:10,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:58:10,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:58:10,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:58:10,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:58:10,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:58:10,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:58:10,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:58:10,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:58:10,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:58:10,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:58:10,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:58:10,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:58:10,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:58:10,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:58:10,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:58:10,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:58:10,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:58:10,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:58:10,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:58:10,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:58:10,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:58:10,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:58:10,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:58:10,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:58:10,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 17:58:11,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:58:11,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:58:11,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:58:11,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:58:11,004 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:58:11,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:58:11,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:58:11,005 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:58:11,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:58:11,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:58:11,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:58:11,006 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:58:11,006 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:58:11,006 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:58:11,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:58:11,007 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:58:11,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:58:11,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:58:11,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:58:11,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:58:11,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:58:11,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:58:11,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:11,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:58:11,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:58:11,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:58:11,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:58:11,010 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 -> 2e9d0e89ee237165e6cd15cb730148b321ca31eb [2019-11-25 17:58:11,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:58:11,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:58:11,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:58:11,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:58:11,351 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:58:11,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2019-11-25 17:58:11,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2a7f0a3/685629005f82442db6cfc8209759f960/FLAG6d0eb4355 [2019-11-25 17:58:11,882 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:58:11,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2019-11-25 17:58:11,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2a7f0a3/685629005f82442db6cfc8209759f960/FLAG6d0eb4355 [2019-11-25 17:58:12,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2a7f0a3/685629005f82442db6cfc8209759f960 [2019-11-25 17:58:12,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:58:12,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:58:12,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:12,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:58:12,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:58:12,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b50e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12, skipping insertion in model container [2019-11-25 17:58:12,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:58:12,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:58:12,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:12,544 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:58:12,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:12,647 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:58:12,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12 WrapperNode [2019-11-25 17:58:12,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:12,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:58:12,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:58:12,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:58:12,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... [2019-11-25 17:58:12,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:58:12,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:58:12,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:58:12,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:58:12,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:58:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:58:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:58:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:58:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:58:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:58:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:58:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:58:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:58:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:58:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:58:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:58:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:58:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:58:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:58:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:58:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:58:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:58:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:58:13,126 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:58:13,127 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-25 17:58:13,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:13 BoogieIcfgContainer [2019-11-25 17:58:13,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:58:13,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:58:13,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:58:13,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:58:13,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:58:12" (1/3) ... [2019-11-25 17:58:13,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1734c569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:13, skipping insertion in model container [2019-11-25 17:58:13,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:12" (2/3) ... [2019-11-25 17:58:13,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1734c569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:13, skipping insertion in model container [2019-11-25 17:58:13,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:13" (3/3) ... [2019-11-25 17:58:13,136 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-11-25 17:58:13,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:58:13,153 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 17:58:13,164 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 17:58:13,180 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:58:13,180 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:58:13,180 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:58:13,181 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:58:13,181 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:58:13,181 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:58:13,181 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:58:13,181 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:58:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-25 17:58:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 17:58:13,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:13,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:13,206 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612475, now seen corresponding path program 1 times [2019-11-25 17:58:13,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:13,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745529905] [2019-11-25 17:58:13,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:13,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745529905] [2019-11-25 17:58:13,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:13,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:58:13,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100993628] [2019-11-25 17:58:13,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:58:13,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:58:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:58:13,478 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-25 17:58:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:13,785 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-25 17:58:13,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:58:13,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-25 17:58:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:13,803 INFO L225 Difference]: With dead ends: 46 [2019-11-25 17:58:13,804 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 17:58:13,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:58:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 17:58:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-25 17:58:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 17:58:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-25 17:58:13,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2019-11-25 17:58:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:13,861 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-25 17:58:13,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:58:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-25 17:58:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 17:58:13,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:13,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:13,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612476, now seen corresponding path program 1 times [2019-11-25 17:58:13,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:13,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210645180] [2019-11-25 17:58:13,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:14,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210645180] [2019-11-25 17:58:14,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:14,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:14,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007184069] [2019-11-25 17:58:14,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:14,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:14,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:14,079 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2019-11-25 17:58:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:14,556 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-11-25 17:58:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:14,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-25 17:58:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:14,559 INFO L225 Difference]: With dead ends: 89 [2019-11-25 17:58:14,559 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 17:58:14,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:58:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 17:58:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-25 17:58:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 17:58:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-25 17:58:14,589 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 13 [2019-11-25 17:58:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:14,589 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-25 17:58:14,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-25 17:58:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:58:14,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:14,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:14,594 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2016377715, now seen corresponding path program 1 times [2019-11-25 17:58:14,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:14,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23500218] [2019-11-25 17:58:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:14,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23500218] [2019-11-25 17:58:14,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:14,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:14,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034102025] [2019-11-25 17:58:14,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:14,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:14,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:14,772 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 7 states. [2019-11-25 17:58:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:15,052 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-25 17:58:15,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:15,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-25 17:58:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:15,055 INFO L225 Difference]: With dead ends: 75 [2019-11-25 17:58:15,055 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 17:58:15,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:58:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 17:58:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-11-25 17:58:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 17:58:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-25 17:58:15,070 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 14 [2019-11-25 17:58:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:15,070 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-25 17:58:15,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-25 17:58:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:58:15,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:15,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:15,072 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2016379159, now seen corresponding path program 1 times [2019-11-25 17:58:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:15,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333604562] [2019-11-25 17:58:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:15,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333604562] [2019-11-25 17:58:15,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:15,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:58:15,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907531099] [2019-11-25 17:58:15,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:15,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:15,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:15,202 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2019-11-25 17:58:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:15,596 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-25 17:58:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:58:15,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 17:58:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:15,598 INFO L225 Difference]: With dead ends: 85 [2019-11-25 17:58:15,598 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 17:58:15,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:58:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 17:58:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2019-11-25 17:58:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:58:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-25 17:58:15,607 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 14 [2019-11-25 17:58:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:15,608 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-25 17:58:15,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-25 17:58:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 17:58:15,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:15,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:15,610 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1916800304, now seen corresponding path program 1 times [2019-11-25 17:58:15,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:15,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429382948] [2019-11-25 17:58:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:15,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429382948] [2019-11-25 17:58:15,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:15,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:58:15,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124154230] [2019-11-25 17:58:15,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:15,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:15,700 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 8 states. [2019-11-25 17:58:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:15,950 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-25 17:58:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:58:15,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-25 17:58:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:15,952 INFO L225 Difference]: With dead ends: 81 [2019-11-25 17:58:15,952 INFO L226 Difference]: Without dead ends: 81 [2019-11-25 17:58:15,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:58:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-25 17:58:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-25 17:58:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 17:58:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-25 17:58:15,959 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 15 [2019-11-25 17:58:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:15,960 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-25 17:58:15,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-25 17:58:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:58:15,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:15,961 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:15,962 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash 538883906, now seen corresponding path program 1 times [2019-11-25 17:58:15,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:15,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578510161] [2019-11-25 17:58:15,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:16,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578510161] [2019-11-25 17:58:16,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:16,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:58:16,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878829287] [2019-11-25 17:58:16,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:16,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:16,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:16,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:16,048 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-11-25 17:58:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:16,373 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-25 17:58:16,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:16,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-25 17:58:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:16,376 INFO L225 Difference]: With dead ends: 109 [2019-11-25 17:58:16,376 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 17:58:16,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 17:58:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-11-25 17:58:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 17:58:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-25 17:58:16,383 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2019-11-25 17:58:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:16,383 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-25 17:58:16,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-25 17:58:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:58:16,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:16,384 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-25 17:58:16,385 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1823655338, now seen corresponding path program 1 times [2019-11-25 17:58:16,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:16,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246363691] [2019-11-25 17:58:16,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:16,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246363691] [2019-11-25 17:58:16,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:16,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:58:16,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512346618] [2019-11-25 17:58:16,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:16,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:16,496 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-11-25 17:58:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:16,859 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-25 17:58:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:58:16,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-25 17:58:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:16,861 INFO L225 Difference]: With dead ends: 109 [2019-11-25 17:58:16,861 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 17:58:16,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:58:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 17:58:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2019-11-25 17:58:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 17:58:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-25 17:58:16,867 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2019-11-25 17:58:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:16,867 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-25 17:58:16,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-25 17:58:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:58:16,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:16,869 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:16,869 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1786595156, now seen corresponding path program 1 times [2019-11-25 17:58:16,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:16,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699845796] [2019-11-25 17:58:16,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:58:17,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699845796] [2019-11-25 17:58:17,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212443843] [2019-11-25 17:58:17,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:58:17,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:58:17,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:58:17,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-11-25 17:58:17,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480858172] [2019-11-25 17:58:17,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:58:17,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:58:17,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:58:17,168 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-25 17:58:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:17,283 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-25 17:58:17,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:58:17,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-25 17:58:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:17,285 INFO L225 Difference]: With dead ends: 61 [2019-11-25 17:58:17,285 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 17:58:17,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:58:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 17:58:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-11-25 17:58:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 17:58:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-25 17:58:17,292 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 33 [2019-11-25 17:58:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:17,292 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-25 17:58:17,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:58:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-25 17:58:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:58:17,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:17,293 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:17,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:17,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:17,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 450123521, now seen corresponding path program 1 times [2019-11-25 17:58:17,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:17,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646758418] [2019-11-25 17:58:17,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:58:17,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646758418] [2019-11-25 17:58:17,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:17,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:58:17,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865668302] [2019-11-25 17:58:17,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:58:17,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:58:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:58:17,584 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-25 17:58:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:17,700 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-25 17:58:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:58:17,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-25 17:58:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:17,702 INFO L225 Difference]: With dead ends: 51 [2019-11-25 17:58:17,702 INFO L226 Difference]: Without dead ends: 51 [2019-11-25 17:58:17,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:58:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-25 17:58:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-25 17:58:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-25 17:58:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-25 17:58:17,707 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2019-11-25 17:58:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:17,707 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-25 17:58:17,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:58:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-25 17:58:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:58:17,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:17,709 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:17,710 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1222990268, now seen corresponding path program 1 times [2019-11-25 17:58:17,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:17,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030901629] [2019-11-25 17:58:17,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:58:17,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030901629] [2019-11-25 17:58:17,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:17,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:17,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770856484] [2019-11-25 17:58:17,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:17,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:17,830 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2019-11-25 17:58:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:17,974 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-25 17:58:17,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:17,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-25 17:58:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:17,975 INFO L225 Difference]: With dead ends: 50 [2019-11-25 17:58:17,975 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 17:58:17,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:58:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 17:58:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 17:58:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 17:58:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-25 17:58:17,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-11-25 17:58:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:17,989 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-25 17:58:17,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-25 17:58:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 17:58:17,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:17,990 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:17,990 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 17:58:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 438004402, now seen corresponding path program 1 times [2019-11-25 17:58:17,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:17,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067538943] [2019-11-25 17:58:17,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:58:18,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067538943] [2019-11-25 17:58:18,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337036085] [2019-11-25 17:58:18,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 17:58:18,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:58:18,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:18,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-25 17:58:18,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871434301] [2019-11-25 17:58:18,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 17:58:18,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 17:58:18,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:58:18,522 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-11-25 17:58:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:21,789 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-11-25 17:58:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-25 17:58:21,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-25 17:58:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:21,791 INFO L225 Difference]: With dead ends: 96 [2019-11-25 17:58:21,791 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:58:21,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 17:58:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:58:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:58:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:58:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:58:21,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-25 17:58:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:21,795 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:58:21,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 17:58:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:58:21,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:58:22,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:22,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:22 BoogieIcfgContainer [2019-11-25 17:58:22,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:58:22,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:58:22,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:58:22,010 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:58:22,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:13" (3/4) ... [2019-11-25 17:58:22,014 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:58:22,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:58:22,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:58:22,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:58:22,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:58:22,040 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-25 17:58:22,041 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:58:22,041 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 17:58:22,041 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:58:22,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:58:22,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:58:22,144 INFO L168 Benchmark]: Toolchain (without parser) took 9830.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 959.0 MB in the beginning and 1.2 GB in the end (delta: -279.9 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:22,145 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:58:22,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:22,145 INFO L168 Benchmark]: Boogie Preprocessor took 56.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:22,147 INFO L168 Benchmark]: RCFGBuilder took 423.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:22,148 INFO L168 Benchmark]: TraceAbstraction took 8877.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -160.5 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:22,148 INFO L168 Benchmark]: Witness Printer took 132.03 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:22,150 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.27 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 336.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8877.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -160.5 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. * Witness Printer took 132.03 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: 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: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: 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: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 53 locations, 16 error locations. Result: SAFE, OverallTime: 8.8s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 327 SDtfs, 964 SDslu, 531 SDs, 0 SdLazy, 1951 SolverSat, 388 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, 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, 11 MinimizatonAttempts, 212 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 8 QuantifiedInterpolants, 49561 SizeOfPredicates, 7 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 33/39 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...