./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-crafted/SyntaxSupportPointer01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f2a8d3919c0496882213752e07135061fdbafdf6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:18:23,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:18:23,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:18:23,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:18:23,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:18:23,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:18:23,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:18:23,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:18:23,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:18:23,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:18:23,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:18:23,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:18:23,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:18:23,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:18:23,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:18:23,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:18:23,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:18:23,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:18:23,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:18:23,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:18:23,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:18:23,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:18:23,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:18:23,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:18:23,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:18:23,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:18:23,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:18:23,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:18:23,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:18:23,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:18:23,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:18:23,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:18:23,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:18:23,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:18:23,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:18:23,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:18:23,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:18:23,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:18:23,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:18:23,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:18:23,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:18:23,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-07-29 01:18:23,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:18:23,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:18:23,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:18:23,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:18:23,467 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:18:23,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:18:23,471 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:18:23,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:18:23,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:18:23,472 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:18:23,472 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:18:23,472 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:18:23,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:18:23,473 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:18:23,473 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:18:23,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:18:23,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:18:23,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:18:23,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:18:23,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:18:23,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:18:23,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:18:23,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:18:23,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:18:23,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:18:23,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2a8d3919c0496882213752e07135061fdbafdf6 [2020-07-29 01:18:23,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:18:23,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:18:23,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:18:23,778 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:18:23,780 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:18:23,781 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-1.c [2020-07-29 01:18:23,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e9a53b/dc6bc0b47d0d4189891b43a0811be6c9/FLAG42d61fc37 [2020-07-29 01:18:24,265 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:18:24,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-1.c [2020-07-29 01:18:24,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e9a53b/dc6bc0b47d0d4189891b43a0811be6c9/FLAG42d61fc37 [2020-07-29 01:18:24,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e9a53b/dc6bc0b47d0d4189891b43a0811be6c9 [2020-07-29 01:18:24,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:18:24,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:18:24,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:24,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:18:24,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:18:24,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:24,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4db3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24, skipping insertion in model container [2020-07-29 01:18:24,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:24,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:18:24,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:18:24,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:24,900 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:18:24,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:24,932 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:18:24,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24 WrapperNode [2020-07-29 01:18:24,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:24,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:18:24,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:18:24,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:18:24,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:24,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:25,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:25,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:25,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:25,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:25,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (1/1) ... [2020-07-29 01:18:25,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:18:25,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:18:25,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:18:25,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:18:25,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (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 [2020-07-29 01:18:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:18:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:18:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:18:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:18:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:18:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:18:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:18:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:18:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:18:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:18:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:18:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:18:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:18:25,375 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:18:25,376 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:18:25,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:25 BoogieIcfgContainer [2020-07-29 01:18:25,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:18:25,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:18:25,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:18:25,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:18:25,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:18:24" (1/3) ... [2020-07-29 01:18:25,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78527adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:25, skipping insertion in model container [2020-07-29 01:18:25,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:24" (2/3) ... [2020-07-29 01:18:25,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78527adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:25, skipping insertion in model container [2020-07-29 01:18:25,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:25" (3/3) ... [2020-07-29 01:18:25,392 INFO L109 eAbstractionObserver]: Analyzing ICFG SyntaxSupportPointer01-1.c [2020-07-29 01:18:25,406 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:18:25,415 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-07-29 01:18:25,434 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-07-29 01:18:25,456 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:18:25,456 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:18:25,457 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:18:25,457 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:18:25,457 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:18:25,457 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:18:25,457 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:18:25,458 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:18:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-29 01:18:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:18:25,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:25,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:25,487 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr11ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2020-07-29 01:18:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash -522028180, now seen corresponding path program 1 times [2020-07-29 01:18:25,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:25,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850662115] [2020-07-29 01:18:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:25,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:25,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-29 01:18:25,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-29 01:18:25,733 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #42#return; {36#true} is VALID [2020-07-29 01:18:25,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:25,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-29 01:18:25,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-29 01:18:25,738 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #42#return; {36#true} is VALID [2020-07-29 01:18:25,738 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2020-07-29 01:18:25,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {41#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:18:25,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {37#false} is VALID [2020-07-29 01:18:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:25,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850662115] [2020-07-29 01:18:25,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:25,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:25,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80385275] [2020-07-29 01:18:25,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:25,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:25,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:25,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:25,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:25,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:25,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:25,786 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-07-29 01:18:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:25,975 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-29 01:18:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:25,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 01:18:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 01:18:25,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-29 01:18:26,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,063 INFO L225 Difference]: With dead ends: 28 [2020-07-29 01:18:26,063 INFO L226 Difference]: Without dead ends: 25 [2020-07-29 01:18:26,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-29 01:18:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 01:18:26,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:26,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-29 01:18:26,100 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-29 01:18:26,100 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-29 01:18:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,105 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-29 01:18:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-29 01:18:26,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,106 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-29 01:18:26,106 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-29 01:18:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,110 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-29 01:18:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-29 01:18:26,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:26,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:18:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2020-07-29 01:18:26,116 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 7 [2020-07-29 01:18:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:26,116 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2020-07-29 01:18:26,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-29 01:18:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:18:26,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:26,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:26,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:18:26,118 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr11ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2020-07-29 01:18:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash -522028179, now seen corresponding path program 1 times [2020-07-29 01:18:26,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:26,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156453013] [2020-07-29 01:18:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:26,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:26,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {154#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {148#true} is VALID [2020-07-29 01:18:26,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2020-07-29 01:18:26,235 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #42#return; {148#true} is VALID [2020-07-29 01:18:26,240 INFO L263 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {154#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:26,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {148#true} is VALID [2020-07-29 01:18:26,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {148#true} assume true; {148#true} is VALID [2020-07-29 01:18:26,242 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} #42#return; {148#true} is VALID [2020-07-29 01:18:26,242 INFO L263 TraceCheckUtils]: 4: Hoare triple {148#true} call #t~ret6 := main(); {148#true} is VALID [2020-07-29 01:18:26,244 INFO L280 TraceCheckUtils]: 5: Hoare triple {148#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {153#(and (= 0 main_~p~0.offset) (= 4 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:18:26,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {153#(and (= 0 main_~p~0.offset) (= 4 (select |#length| main_~p~0.base)))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {149#false} is VALID [2020-07-29 01:18:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:26,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156453013] [2020-07-29 01:18:26,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:26,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:26,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520893961] [2020-07-29 01:18:26,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:26,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:26,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:26,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:26,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:26,265 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 4 states. [2020-07-29 01:18:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,386 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-29 01:18:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:26,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-07-29 01:18:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-07-29 01:18:26,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2020-07-29 01:18:26,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,439 INFO L225 Difference]: With dead ends: 20 [2020-07-29 01:18:26,440 INFO L226 Difference]: Without dead ends: 20 [2020-07-29 01:18:26,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-29 01:18:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 01:18:26,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:26,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-29 01:18:26,445 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 01:18:26,445 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 01:18:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,447 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-29 01:18:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 01:18:26,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,449 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 01:18:26,449 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 01:18:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,451 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-29 01:18:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 01:18:26,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:26,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:18:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-29 01:18:26,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2020-07-29 01:18:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:26,456 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-29 01:18:26,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 01:18:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:18:26,457 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:26,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:26,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:18:26,458 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr11ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2020-07-29 01:18:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash -141661244, now seen corresponding path program 1 times [2020-07-29 01:18:26,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:26,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834996280] [2020-07-29 01:18:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:26,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:26,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {237#true} is VALID [2020-07-29 01:18:26,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2020-07-29 01:18:26,556 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #42#return; {237#true} is VALID [2020-07-29 01:18:26,558 INFO L263 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:26,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {237#true} is VALID [2020-07-29 01:18:26,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2020-07-29 01:18:26,559 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #42#return; {237#true} is VALID [2020-07-29 01:18:26,559 INFO L263 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret6 := main(); {237#true} is VALID [2020-07-29 01:18:26,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:18:26,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(#t~nondet2, ~p~0.base, ~p~0.offset, 4); srcloc: L15 {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:18:26,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} havoc #t~nondet2; {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:18:26,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem3 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L16-3 {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:18:26,566 INFO L280 TraceCheckUtils]: 9: Hoare triple {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(#t~mem3 >= 0);havoc #t~mem3; {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:18:26,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume 0 == ~p~0.offset; {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:18:26,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(~p~0.base < #StackHeapBarrier); {238#false} is VALID [2020-07-29 01:18:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:26,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834996280] [2020-07-29 01:18:26,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:26,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:26,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220298784] [2020-07-29 01:18:26,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:18:26,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:26,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:26,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:26,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:26,597 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2020-07-29 01:18:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,681 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-29 01:18:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:26,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:18:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:18:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:18:26,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2020-07-29 01:18:26,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,715 INFO L225 Difference]: With dead ends: 19 [2020-07-29 01:18:26,715 INFO L226 Difference]: Without dead ends: 19 [2020-07-29 01:18:26,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-29 01:18:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 01:18:26,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:26,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-29 01:18:26,719 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:18:26,720 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:18:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,722 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-29 01:18:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-29 01:18:26,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,723 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:18:26,723 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:18:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,726 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-29 01:18:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-29 01:18:26,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:26,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:18:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-29 01:18:26,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2020-07-29 01:18:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:26,730 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-29 01:18:26,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-29 01:18:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:18:26,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:26,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:26,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:18:26,732 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr11ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION]=== [2020-07-29 01:18:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1302500167, now seen corresponding path program 1 times [2020-07-29 01:18:26,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:26,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037033355] [2020-07-29 01:18:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:26,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:26,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {322#true} is VALID [2020-07-29 01:18:26,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-29 01:18:26,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #42#return; {322#true} is VALID [2020-07-29 01:18:26,833 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:26,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {322#true} is VALID [2020-07-29 01:18:26,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-29 01:18:26,834 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {322#true} {322#true} #42#return; {322#true} is VALID [2020-07-29 01:18:26,835 INFO L263 TraceCheckUtils]: 4: Hoare triple {322#true} call #t~ret6 := main(); {327#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:18:26,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {327#(= |#valid| |old(#valid)|)} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} SUMMARY for call write~int(#t~nondet2, ~p~0.base, ~p~0.offset, 4); srcloc: L15 {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} havoc #t~nondet2; {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} SUMMARY for call #t~mem3 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L16-3 {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume !(#t~mem3 >= 0);havoc #t~mem3; {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,842 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume 0 == ~p~0.offset; {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,843 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume ~p~0.base < #StackHeapBarrier; {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:18:26,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {328#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset);#res := 0; {327#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:18:26,845 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {323#false} is VALID [2020-07-29 01:18:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:26,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037033355] [2020-07-29 01:18:26,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:26,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:18:26,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934808325] [2020-07-29 01:18:26,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-29 01:18:26,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:26,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:26,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:26,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:26,875 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2020-07-29 01:18:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,965 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-29 01:18:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:26,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-29 01:18:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:18:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:18:26,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-29 01:18:26,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:26,995 INFO L225 Difference]: With dead ends: 18 [2020-07-29 01:18:26,995 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:18:26,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:18:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:18:26,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:26,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:26,997 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:26,997 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,998 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:18:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:18:26,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:26,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:26,998 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:26,999 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:18:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:26,999 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:18:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:18:27,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:27,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:27,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:27,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:18:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:18:27,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-29 01:18:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:27,002 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:18:27,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:18:27,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:27,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:18:27,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:18:27 BoogieIcfgContainer [2020-07-29 01:18:27,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:18:27,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:18:27,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:18:27,011 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:18:27,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:25" (3/4) ... [2020-07-29 01:18:27,016 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:18:27,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:18:27,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:18:27,029 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-29 01:18:27,029 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-29 01:18:27,030 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:18:27,030 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:18:27,080 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:18:27,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:18:27,084 INFO L168 Benchmark]: Toolchain (without parser) took 2408.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 961.6 MB in the beginning and 954.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:27,085 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:18:27,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:27,086 INFO L168 Benchmark]: Boogie Preprocessor took 88.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:27,087 INFO L168 Benchmark]: RCFGBuilder took 359.99 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:27,087 INFO L168 Benchmark]: TraceAbstraction took 1626.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.8 MB in the end (delta: 157.4 MB). Peak memory consumption was 157.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:18:27,088 INFO L168 Benchmark]: Witness Printer took 70.40 ms. Allocated memory is still 1.2 GB. Free memory is still 954.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:18:27,091 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.99 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1626.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.8 MB in the end (delta: 157.4 MB). Peak memory consumption was 157.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.40 ms. Allocated memory is still 1.2 GB. Free memory is still 954.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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 3 procedures, 33 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 46 SDtfs, 44 SDslu, 30 SDs, 0 SdLazy, 109 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...