./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-read.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-memsafety/ArraysOfVariableLength2_-read.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 639853f2f40cff84155fe09902eff2b5a20185f5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:00:07,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:00:07,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:00:07,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:00:07,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:00:07,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:00:07,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:00:07,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:00:07,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:00:07,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:00:07,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:00:07,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:00:07,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:00:07,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:00:07,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:00:07,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:00:07,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:00:07,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:00:07,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:00:07,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:00:07,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:00:07,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:00:07,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:00:07,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:00:07,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:00:07,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:00:07,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:00:07,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:00:07,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:00:07,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:00:07,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:00:07,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:00:07,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:00:07,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:00:07,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:00:07,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:00:07,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:00:07,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:00:07,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:00:07,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:00:07,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:00:07,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:00:07,957 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:00:07,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:00:07,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:00:07,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:00:07,963 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:00:07,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:00:07,964 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:00:07,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:00:07,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:00:07,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:00:07,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:00:07,965 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:00:07,965 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:00:07,965 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:00:07,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:00:07,966 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:00:07,966 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:00:07,969 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:00:07,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:00:07,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:00:07,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:00:07,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:00:07,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:00:07,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:00:07,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:00:07,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:00:07,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:00:07,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:00:07,972 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 -> 639853f2f40cff84155fe09902eff2b5a20185f5 [2020-07-29 01:00:08,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:00:08,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:00:08,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:00:08,317 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:00:08,318 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:00:08,319 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-read.c [2020-07-29 01:00:08,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92012a324/c608b0759e534f24b5660f72203c92fb/FLAGb5947047b [2020-07-29 01:00:08,863 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:00:08,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-read.c [2020-07-29 01:00:08,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92012a324/c608b0759e534f24b5660f72203c92fb/FLAGb5947047b [2020-07-29 01:00:09,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92012a324/c608b0759e534f24b5660f72203c92fb [2020-07-29 01:00:09,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:00:09,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:00:09,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:09,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:00:09,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:00:09,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3995f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09, skipping insertion in model container [2020-07-29 01:00:09,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:00:09,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:00:09,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:09,483 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:00:09,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:09,585 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:00:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09 WrapperNode [2020-07-29 01:00:09,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:09,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:00:09,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:00:09,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:00:09,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (1/1) ... [2020-07-29 01:00:09,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:00:09,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:00:09,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:00:09,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:00:09,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (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:00:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:00:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:00:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2020-07-29 01:00:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-07-29 01:00:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:00:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2020-07-29 01:00:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:00:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-07-29 01:00:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:00:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:00:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:00:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:00:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:00:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:00:10,299 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:00:10,299 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:00:10,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:10 BoogieIcfgContainer [2020-07-29 01:00:10,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:00:10,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:00:10,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:00:10,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:00:10,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:00:09" (1/3) ... [2020-07-29 01:00:10,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a45d47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:10, skipping insertion in model container [2020-07-29 01:00:10,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:09" (2/3) ... [2020-07-29 01:00:10,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a45d47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:10, skipping insertion in model container [2020-07-29 01:00:10,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:10" (3/3) ... [2020-07-29 01:00:10,315 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_-read.c [2020-07-29 01:00:10,327 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:00:10,337 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-07-29 01:00:10,353 INFO L251 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-07-29 01:00:10,376 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:00:10,377 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:00:10,377 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:00:10,377 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:00:10,378 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:00:10,378 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:00:10,378 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:00:10,378 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:00:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-29 01:00:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:10,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:10,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:10,409 INFO L427 AbstractCegarLoop]: === Iteration 1 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1403638412, now seen corresponding path program 1 times [2020-07-29 01:00:10,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:10,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724783658] [2020-07-29 01:00:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:10,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:10,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#(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; {55#true} is VALID [2020-07-29 01:00:10,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-29 01:00:10,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55#true} {55#true} #101#return; {55#true} is VALID [2020-07-29 01:00:10,625 INFO L263 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {60#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:10,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#(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; {55#true} is VALID [2020-07-29 01:00:10,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-29 01:00:10,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {55#true} {55#true} #101#return; {55#true} is VALID [2020-07-29 01:00:10,626 INFO L263 TraceCheckUtils]: 4: Hoare triple {55#true} call #t~ret8 := main(); {55#true} is VALID [2020-07-29 01:00:10,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {55#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {55#true} is VALID [2020-07-29 01:00:10,631 INFO L280 TraceCheckUtils]: 6: Hoare triple {55#true} assume !true; {56#false} is VALID [2020-07-29 01:00:10,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#false} ~i~2 := 0; {56#false} is VALID [2020-07-29 01:00:10,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#false} assume !!(~i~2 < 100); {56#false} is VALID [2020-07-29 01:00:10,632 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#false} assume !(1 == #valid[~#b~0.base]); {56#false} is VALID [2020-07-29 01:00:10,633 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:00:10,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724783658] [2020-07-29 01:00:10,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:10,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:10,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123794523] [2020-07-29 01:00:10,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:00:10,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:10,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:00:10,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:10,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:00:10,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:10,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:00:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:00:10,688 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-29 01:00:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:10,945 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-07-29 01:00:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:00:10,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:00:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:00:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-29 01:00:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:00:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-29 01:00:10,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2020-07-29 01:00:11,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:11,074 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:00:11,075 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:00:11,077 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:00:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:00:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-29 01:00:11,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:11,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:11,118 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:11,118 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:11,126 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-29 01:00:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:00:11,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:11,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:11,128 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:11,128 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:11,135 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-29 01:00:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:00:11,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:11,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:11,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:11,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:00:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-07-29 01:00:11,144 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 10 [2020-07-29 01:00:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:11,145 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-07-29 01:00:11,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:00:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:00:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:11,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:11,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:11,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:00:11,147 INFO L427 AbstractCegarLoop]: === Iteration 2 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1403995904, now seen corresponding path program 1 times [2020-07-29 01:00:11,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:11,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523921065] [2020-07-29 01:00:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:11,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:11,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#(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; {262#true} is VALID [2020-07-29 01:00:11,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2020-07-29 01:00:11,242 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #101#return; {262#true} is VALID [2020-07-29 01:00:11,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:11,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#(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; {262#true} is VALID [2020-07-29 01:00:11,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2020-07-29 01:00:11,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #101#return; {262#true} is VALID [2020-07-29 01:00:11,245 INFO L263 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret8 := main(); {262#true} is VALID [2020-07-29 01:00:11,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {267#(= 0 main_~i~2)} is VALID [2020-07-29 01:00:11,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {267#(= 0 main_~i~2)} assume !(~i~2 < 100); {263#false} is VALID [2020-07-29 01:00:11,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#false} ~i~2 := 0; {263#false} is VALID [2020-07-29 01:00:11,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {263#false} assume !!(~i~2 < 100); {263#false} is VALID [2020-07-29 01:00:11,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#false} assume !(1 == #valid[~#b~0.base]); {263#false} is VALID [2020-07-29 01:00:11,249 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:00:11,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523921065] [2020-07-29 01:00:11,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:11,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:00:11,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256749074] [2020-07-29 01:00:11,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:11,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:11,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:11,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:11,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:11,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:11,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:11,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:11,269 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2020-07-29 01:00:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:11,557 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-29 01:00:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:11,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2020-07-29 01:00:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2020-07-29 01:00:11,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2020-07-29 01:00:11,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:11,691 INFO L225 Difference]: With dead ends: 56 [2020-07-29 01:00:11,695 INFO L226 Difference]: Without dead ends: 56 [2020-07-29 01:00:11,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:00:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-29 01:00:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2020-07-29 01:00:11,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:11,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 49 states. [2020-07-29 01:00:11,710 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 49 states. [2020-07-29 01:00:11,710 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 49 states. [2020-07-29 01:00:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:11,730 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-29 01:00:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-29 01:00:11,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:11,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:11,732 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 56 states. [2020-07-29 01:00:11,733 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 56 states. [2020-07-29 01:00:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:11,742 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-29 01:00:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-29 01:00:11,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:11,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:11,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:11,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:00:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-29 01:00:11,757 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2020-07-29 01:00:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:11,759 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-29 01:00:11,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-29 01:00:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:11,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:11,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:11,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:00:11,762 INFO L427 AbstractCegarLoop]: === Iteration 3 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:11,762 INFO L82 PathProgramCache]: Analyzing trace with hash -571487811, now seen corresponding path program 1 times [2020-07-29 01:00:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:11,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408939804] [2020-07-29 01:00:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:11,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:11,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#(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; {488#true} is VALID [2020-07-29 01:00:11,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-29 01:00:11,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} #101#return; {488#true} is VALID [2020-07-29 01:00:11,930 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {496#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:11,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#(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; {488#true} is VALID [2020-07-29 01:00:11,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-29 01:00:11,931 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #101#return; {488#true} is VALID [2020-07-29 01:00:11,931 INFO L263 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret8 := main(); {488#true} is VALID [2020-07-29 01:00:11,933 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {493#(= 0 main_~i~2)} is VALID [2020-07-29 01:00:11,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#(= 0 main_~i~2)} assume !!(~i~2 < 100); {493#(= 0 main_~i~2)} is VALID [2020-07-29 01:00:11,936 INFO L263 TraceCheckUtils]: 7: Hoare triple {493#(= 0 main_~i~2)} call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, ~i~2); {494#(= 0 |foo_#in~size|)} is VALID [2020-07-29 01:00:11,937 INFO L280 TraceCheckUtils]: 8: Hoare triple {494#(= 0 |foo_#in~size|)} ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4 * ~n);havoc ~i~1;~i~1 := 0; {495#(and (= 0 foo_~i~1) (= 0 foo_~size))} is VALID [2020-07-29 01:00:11,938 INFO L280 TraceCheckUtils]: 9: Hoare triple {495#(and (= 0 foo_~i~1) (= 0 foo_~size))} assume !!(~i~1 < ~size); {489#false} is VALID [2020-07-29 01:00:11,938 INFO L280 TraceCheckUtils]: 10: Hoare triple {489#false} assume !(1 == #valid[~b.base]); {489#false} is VALID [2020-07-29 01:00:11,940 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:00:11,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408939804] [2020-07-29 01:00:11,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:11,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:00:11,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880657863] [2020-07-29 01:00:11,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:11,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:11,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:11,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:11,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:11,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:11,960 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2020-07-29 01:00:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:12,516 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2020-07-29 01:00:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:12,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2020-07-29 01:00:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2020-07-29 01:00:12,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2020-07-29 01:00:12,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:12,620 INFO L225 Difference]: With dead ends: 63 [2020-07-29 01:00:12,620 INFO L226 Difference]: Without dead ends: 63 [2020-07-29 01:00:12,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-29 01:00:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2020-07-29 01:00:12,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:12,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 57 states. [2020-07-29 01:00:12,627 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 57 states. [2020-07-29 01:00:12,628 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 57 states. [2020-07-29 01:00:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:12,632 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2020-07-29 01:00:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-07-29 01:00:12,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:12,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:12,633 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 63 states. [2020-07-29 01:00:12,634 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 63 states. [2020-07-29 01:00:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:12,638 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2020-07-29 01:00:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-07-29 01:00:12,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:12,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:12,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:12,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-29 01:00:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2020-07-29 01:00:12,644 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 11 [2020-07-29 01:00:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:12,645 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2020-07-29 01:00:12,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2020-07-29 01:00:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:00:12,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:12,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:12,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:00:12,647 INFO L427 AbstractCegarLoop]: === Iteration 4 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash 57103265, now seen corresponding path program 1 times [2020-07-29 01:00:12,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:12,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155607864] [2020-07-29 01:00:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:12,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:12,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {757#(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; {749#true} is VALID [2020-07-29 01:00:12,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-29 01:00:12,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {749#true} {749#true} #101#return; {749#true} is VALID [2020-07-29 01:00:12,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {749#true} call ULTIMATE.init(); {757#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:12,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {757#(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; {749#true} is VALID [2020-07-29 01:00:12,766 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-29 01:00:12,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {749#true} {749#true} #101#return; {749#true} is VALID [2020-07-29 01:00:12,767 INFO L263 TraceCheckUtils]: 4: Hoare triple {749#true} call #t~ret8 := main(); {749#true} is VALID [2020-07-29 01:00:12,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {749#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {749#true} is VALID [2020-07-29 01:00:12,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {749#true} assume !!(~i~2 < 100); {749#true} is VALID [2020-07-29 01:00:12,768 INFO L263 TraceCheckUtils]: 7: Hoare triple {749#true} call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, ~i~2); {749#true} is VALID [2020-07-29 01:00:12,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {749#true} ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4 * ~n);havoc ~i~1;~i~1 := 0; {754#(= 1 (select |#valid| |foo_~#a~0.base|))} is VALID [2020-07-29 01:00:12,770 INFO L280 TraceCheckUtils]: 9: Hoare triple {754#(= 1 (select |#valid| |foo_~#a~0.base|))} assume !(~i~1 < ~size); {754#(= 1 (select |#valid| |foo_~#a~0.base|))} is VALID [2020-07-29 01:00:12,771 INFO L263 TraceCheckUtils]: 10: Hoare triple {754#(= 1 (select |#valid| |foo_~#a~0.base|))} call #t~ret4 := bar(~#a~0.base, ~#a~0.offset, 1 + ~size); {755#(= 1 (select |#valid| |bar_#in~b.base|))} is VALID [2020-07-29 01:00:12,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {755#(= 1 (select |#valid| |bar_#in~b.base|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;~res~0 := 0;havoc ~i~0;~i~0 := 0; {756#(= 1 (select |#valid| bar_~b.base))} is VALID [2020-07-29 01:00:12,775 INFO L280 TraceCheckUtils]: 12: Hoare triple {756#(= 1 (select |#valid| bar_~b.base))} assume !!(~i~0 < ~size); {756#(= 1 (select |#valid| bar_~b.base))} is VALID [2020-07-29 01:00:12,776 INFO L280 TraceCheckUtils]: 13: Hoare triple {756#(= 1 (select |#valid| bar_~b.base))} assume !(1 == #valid[~b.base]); {750#false} is VALID [2020-07-29 01:00:12,777 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:00:12,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155607864] [2020-07-29 01:00:12,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:12,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:00:12,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893544989] [2020-07-29 01:00:12,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:00:12,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:12,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:12,803 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:00:12,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:12,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:12,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:12,805 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2020-07-29 01:00:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:13,236 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-29 01:00:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:13,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:00:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-29 01:00:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-29 01:00:13,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2020-07-29 01:00:13,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:13,321 INFO L225 Difference]: With dead ends: 55 [2020-07-29 01:00:13,321 INFO L226 Difference]: Without dead ends: 55 [2020-07-29 01:00:13,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-29 01:00:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-29 01:00:13,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:13,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:13,332 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:13,332 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:13,338 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-29 01:00:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-29 01:00:13,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:13,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:13,342 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:13,342 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:13,347 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-29 01:00:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-29 01:00:13,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:13,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:13,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:13,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 01:00:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2020-07-29 01:00:13,356 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 14 [2020-07-29 01:00:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:13,357 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2020-07-29 01:00:13,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-29 01:00:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:00:13,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:13,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:13,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:00:13,359 INFO L427 AbstractCegarLoop]: === Iteration 5 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 57103266, now seen corresponding path program 1 times [2020-07-29 01:00:13,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:13,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055391772] [2020-07-29 01:00:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:00:13,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:00:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:00:13,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:00:13,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:00:13,475 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:00:13,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:00:13,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:00:13 BoogieIcfgContainer [2020-07-29 01:00:13,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:00:13,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:00:13,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:00:13,505 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:00:13,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:10" (3/4) ... [2020-07-29 01:00:13,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:00:13,559 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:00:13,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:00:13,562 INFO L168 Benchmark]: Toolchain (without parser) took 4304.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:13,563 INFO L168 Benchmark]: CDTParser took 0.34 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:00:13,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:13,564 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:13,565 INFO L168 Benchmark]: RCFGBuilder took 676.37 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: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:13,566 INFO L168 Benchmark]: TraceAbstraction took 3197.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.8 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:13,566 INFO L168 Benchmark]: Witness Printer took 55.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:00:13,570 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.34 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 326.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.92 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 676.37 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: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3197.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.8 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 VAL [b={3:0}, i=0] [L33] COND TRUE i < 100 VAL [b={3:0}, i=0] [L34] CALL foo(i, b, i) VAL [\old(n)=0, \old(size)=0, b={3:0}] [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=0, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=0] [L22] COND FALSE !(i < size) VAL [\old(n)=0, \old(size)=0, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=0] [L25] CALL bar(a, size + 1) VAL [\old(size)=1, b={2:0}] [L12] int res = 0, i; [L13] i = 0 VAL [\old(size)=1, b={2:0}, b={2:0}, i=0, res=0, size=1] [L13] COND TRUE i < size VAL [\old(size)=1, b={2:0}, b={2:0}, i=0, res=0, size=1] [L14] b[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 52 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 164 SDtfs, 101 SDslu, 178 SDs, 0 SdLazy, 340 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, 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, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1198 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 incorrect! Received shutdown request...