./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --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/list-properties/list_flag-2.i -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 afc88cbf4886a453fed887733400308a528b9724 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 afc88cbf4886a453fed887733400308a528b9724 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:10:10,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:10:10,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:10:10,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:10:10,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:10:10,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:10:10,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:10:10,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:10:10,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:10:10,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:10:10,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:10:10,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:10:10,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:10:10,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:10:10,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:10:10,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:10:10,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:10:10,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:10:10,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:10:10,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:10:10,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:10:10,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:10:10,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:10:10,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:10:10,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:10:10,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:10:10,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:10:10,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:10:10,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:10:10,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:10:10,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:10:10,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:10:10,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:10:10,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:10:10,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:10:10,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:10:10,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:10:10,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:10:10,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:10:10,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:10:10,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:10:10,603 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:10:10,619 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:10:10,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:10:10,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:10:10,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:10:10,625 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:10:10,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:10:10,625 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:10:10,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:10:10,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:10:10,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:10:10,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:10:10,628 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:10:10,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:10:10,629 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:10:10,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:10:10,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:10:10,630 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:10:10,630 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:10:10,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:10:10,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:10:10,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:10:10,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:10:10,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:10:10,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:10:10,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:10:10,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:10:10,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:10:10,633 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:10:10,634 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 -> afc88cbf4886a453fed887733400308a528b9724 [2020-07-29 01:10:10,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:10:10,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:10:10,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:10:10,975 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:10:10,976 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:10:10,976 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2020-07-29 01:10:11,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db63e4ad/93f5917c32754b788d07e65028c8ce25/FLAGa68613379 [2020-07-29 01:10:11,541 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:10:11,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2020-07-29 01:10:11,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db63e4ad/93f5917c32754b788d07e65028c8ce25/FLAGa68613379 [2020-07-29 01:10:11,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db63e4ad/93f5917c32754b788d07e65028c8ce25 [2020-07-29 01:10:11,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:10:11,856 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:10:11,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:11,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:10:11,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:10:11,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:11" (1/1) ... [2020-07-29 01:10:11,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4495374b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:11, skipping insertion in model container [2020-07-29 01:10:11,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:11" (1/1) ... [2020-07-29 01:10:11,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:10:11,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:10:12,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:12,351 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:10:12,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:12,460 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:10:12,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12 WrapperNode [2020-07-29 01:10:12,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:12,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:10:12,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:10:12,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:10:12,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... [2020-07-29 01:10:12,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:10:12,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:10:12,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:10:12,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:10:12,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:10:12,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:10:12,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:10:12,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:10:12,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:10:12,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:10:12,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:10:12,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:10:12,600 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:10:12,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:10:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:10:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:10:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:10:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:10:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:10:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:10:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:10:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:10:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:10:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:10:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:10:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:10:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:10:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:10:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:10:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:10:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:10:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:10:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:10:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:10:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:10:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:10:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:10:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:10:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:10:12,609 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:10:12,609 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:10:12,609 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:10:12,609 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:10:12,609 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:10:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:10:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:10:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:10:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:10:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:10:12,611 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:10:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:10:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:10:12,612 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:10:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:10:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:10:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:10:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:10:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:10:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:10:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:10:12,614 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:10:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:10:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:10:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:10:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:10:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:10:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:10:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:10:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:10:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:10:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:10:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:10:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:10:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:10:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:10:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:10:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:10:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:10:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:10:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:10:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:10:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:10:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:10:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:10:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:10:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:10:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:10:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:10:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:10:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:10:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:10:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:10:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:10:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:10:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:10:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:10:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:10:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:10:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:10:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:10:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:10:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:10:12,626 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:10:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:10:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:10:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:10:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:10:12,627 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:10:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:10:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:10:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:10:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:10:12,628 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:10:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:10:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:10:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:10:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:10:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:10:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:10:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:10:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:10:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:10:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:10:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:10:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:10:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:10:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:10:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:10:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:10:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:10:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:10:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:10:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:10:13,025 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:10:13,321 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:10:13,321 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-29 01:10:13,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:13 BoogieIcfgContainer [2020-07-29 01:10:13,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:10:13,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:10:13,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:10:13,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:10:13,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:10:11" (1/3) ... [2020-07-29 01:10:13,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae60087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:13, skipping insertion in model container [2020-07-29 01:10:13,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:12" (2/3) ... [2020-07-29 01:10:13,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae60087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:13, skipping insertion in model container [2020-07-29 01:10:13,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:13" (3/3) ... [2020-07-29 01:10:13,334 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2020-07-29 01:10:13,344 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:10:13,352 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-07-29 01:10:13,365 INFO L251 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-07-29 01:10:13,382 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:10:13,383 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:10:13,383 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:10:13,385 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:10:13,385 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:10:13,386 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:10:13,386 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:10:13,386 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:10:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-07-29 01:10:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:13,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:13,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:13,409 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2131838764, now seen corresponding path program 1 times [2020-07-29 01:10:13,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:13,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107332280] [2020-07-29 01:10:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:13,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:13,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#(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; {65#true} is VALID [2020-07-29 01:10:13,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-29 01:10:13,615 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65#true} {65#true} #135#return; {65#true} is VALID [2020-07-29 01:10:13,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {70#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:13,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#(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; {65#true} is VALID [2020-07-29 01:10:13,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-29 01:10:13,622 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #135#return; {65#true} is VALID [2020-07-29 01:10:13,622 INFO L263 TraceCheckUtils]: 4: Hoare triple {65#true} call #t~ret12 := main(); {65#true} is VALID [2020-07-29 01:10:13,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {65#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {65#true} is VALID [2020-07-29 01:10:13,623 INFO L280 TraceCheckUtils]: 6: Hoare triple {65#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {65#true} is VALID [2020-07-29 01:10:13,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {65#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {65#true} is VALID [2020-07-29 01:10:13,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {65#true} assume !true; {66#false} is VALID [2020-07-29 01:10:13,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {66#false} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {66#false} is VALID [2020-07-29 01:10:13,626 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:10:13,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107332280] [2020-07-29 01:10:13,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:13,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:10:13,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755724502] [2020-07-29 01:10:13,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:10:13,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:13,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:10:13,665 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:10:13,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:10:13,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:10:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:10:13,679 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-07-29 01:10:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:13,970 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-07-29 01:10:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:10:13,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:10:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:10:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2020-07-29 01:10:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:10:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2020-07-29 01:10:13,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2020-07-29 01:10:14,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:14,095 INFO L225 Difference]: With dead ends: 62 [2020-07-29 01:10:14,096 INFO L226 Difference]: Without dead ends: 55 [2020-07-29 01:10:14,098 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:10:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-29 01:10:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-29 01:10:14,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:14,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-29 01:10:14,134 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-29 01:10:14,135 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-29 01:10:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:14,141 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 01:10:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 01:10:14,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:14,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:14,143 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-29 01:10:14,143 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-29 01:10:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:14,149 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 01:10:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 01:10:14,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:14,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:14,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:14,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 01:10:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-29 01:10:14,157 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 10 [2020-07-29 01:10:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:14,157 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-29 01:10:14,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:10:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 01:10:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:10:14,158 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:14,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:14,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:10:14,159 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1662458549, now seen corresponding path program 1 times [2020-07-29 01:10:14,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:14,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065270763] [2020-07-29 01:10:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:14,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:14,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#(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; {300#true} is VALID [2020-07-29 01:10:14,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-29 01:10:14,334 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #135#return; {300#true} is VALID [2020-07-29 01:10:14,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:14,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#(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; {300#true} is VALID [2020-07-29 01:10:14,336 INFO L280 TraceCheckUtils]: 2: Hoare triple {300#true} assume true; {300#true} is VALID [2020-07-29 01:10:14,337 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {300#true} {300#true} #135#return; {300#true} is VALID [2020-07-29 01:10:14,337 INFO L263 TraceCheckUtils]: 4: Hoare triple {300#true} call #t~ret12 := main(); {300#true} is VALID [2020-07-29 01:10:14,339 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {305#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:10:14,340 INFO L280 TraceCheckUtils]: 6: Hoare triple {305#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {305#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:10:14,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {305#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {306#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:14,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {306#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {306#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:14,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {306#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {306#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:14,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {301#false} is VALID [2020-07-29 01:10:14,350 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:10:14,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065270763] [2020-07-29 01:10:14,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:14,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:10:14,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733455471] [2020-07-29 01:10:14,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:14,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:14,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:10:14,372 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:10:14,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:10:14,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:10:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:14,376 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2020-07-29 01:10:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:14,945 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-07-29 01:10:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:14,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2020-07-29 01:10:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2020-07-29 01:10:14,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 108 transitions. [2020-07-29 01:10:15,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:15,120 INFO L225 Difference]: With dead ends: 91 [2020-07-29 01:10:15,120 INFO L226 Difference]: Without dead ends: 91 [2020-07-29 01:10:15,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-29 01:10:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2020-07-29 01:10:15,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:15,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 72 states. [2020-07-29 01:10:15,133 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 72 states. [2020-07-29 01:10:15,134 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 72 states. [2020-07-29 01:10:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:15,142 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-07-29 01:10:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-07-29 01:10:15,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:15,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:15,146 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 91 states. [2020-07-29 01:10:15,146 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 91 states. [2020-07-29 01:10:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:15,155 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-07-29 01:10:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-07-29 01:10:15,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:15,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:15,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:15,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-29 01:10:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2020-07-29 01:10:15,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 11 [2020-07-29 01:10:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:15,169 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2020-07-29 01:10:15,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:10:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2020-07-29 01:10:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:10:15,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:15,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:15,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:10:15,171 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1662458548, now seen corresponding path program 1 times [2020-07-29 01:10:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:15,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106669288] [2020-07-29 01:10:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:15,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:15,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {664#(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; {657#true} is VALID [2020-07-29 01:10:15,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {657#true} assume true; {657#true} is VALID [2020-07-29 01:10:15,262 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {657#true} {657#true} #135#return; {657#true} is VALID [2020-07-29 01:10:15,266 INFO L263 TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {664#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:15,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {664#(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; {657#true} is VALID [2020-07-29 01:10:15,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {657#true} assume true; {657#true} is VALID [2020-07-29 01:10:15,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {657#true} {657#true} #135#return; {657#true} is VALID [2020-07-29 01:10:15,267 INFO L263 TraceCheckUtils]: 4: Hoare triple {657#true} call #t~ret12 := main(); {657#true} is VALID [2020-07-29 01:10:15,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {657#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {662#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:15,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {662#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {662#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:15,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {662#(= 1 (select |#valid| main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {663#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:15,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {663#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {663#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:15,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {663#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet4);havoc #t~nondet4; {663#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:15,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {663#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {658#false} is VALID [2020-07-29 01:10:15,275 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:10:15,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106669288] [2020-07-29 01:10:15,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:15,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:10:15,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680262113] [2020-07-29 01:10:15,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:15,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:15,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:10:15,295 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:10:15,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:10:15,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:10:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:15,297 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand 5 states. [2020-07-29 01:10:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:15,659 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-29 01:10:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:15,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2020-07-29 01:10:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2020-07-29 01:10:15,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2020-07-29 01:10:15,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:15,788 INFO L225 Difference]: With dead ends: 67 [2020-07-29 01:10:15,788 INFO L226 Difference]: Without dead ends: 67 [2020-07-29 01:10:15,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-29 01:10:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-29 01:10:15,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:15,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-29 01:10:15,794 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-29 01:10:15,794 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-29 01:10:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:15,798 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-29 01:10:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-29 01:10:15,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:15,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:15,799 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-29 01:10:15,800 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-29 01:10:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:15,803 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-29 01:10:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-29 01:10:15,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:15,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:15,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:15,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-29 01:10:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2020-07-29 01:10:15,808 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 11 [2020-07-29 01:10:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:15,809 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2020-07-29 01:10:15,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:10:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-29 01:10:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:10:15,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:15,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:15,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:10:15,811 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1397561430, now seen corresponding path program 1 times [2020-07-29 01:10:15,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:15,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781706609] [2020-07-29 01:10:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:15,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:15,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {946#(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; {937#true} is VALID [2020-07-29 01:10:15,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {937#true} assume true; {937#true} is VALID [2020-07-29 01:10:15,950 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {937#true} {937#true} #135#return; {937#true} is VALID [2020-07-29 01:10:15,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {937#true} call ULTIMATE.init(); {946#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:15,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {946#(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; {937#true} is VALID [2020-07-29 01:10:15,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {937#true} assume true; {937#true} is VALID [2020-07-29 01:10:15,952 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {937#true} {937#true} #135#return; {937#true} is VALID [2020-07-29 01:10:15,952 INFO L263 TraceCheckUtils]: 4: Hoare triple {937#true} call #t~ret12 := main(); {937#true} is VALID [2020-07-29 01:10:15,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {937#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {937#true} is VALID [2020-07-29 01:10:15,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {937#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {937#true} is VALID [2020-07-29 01:10:15,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {937#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {942#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:15,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {942#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {942#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:15,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {942#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {942#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:15,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {942#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-4 {943#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:10:15,961 INFO L280 TraceCheckUtils]: 11: Hoare triple {943#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {944#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:15,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {944#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0; {944#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:15,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {944#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L540-3 {945#(= 3 |main_#t~mem7|)} is VALID [2020-07-29 01:10:15,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {945#(= 3 |main_#t~mem7|)} assume !!(1 == #t~mem7);havoc #t~mem7; {938#false} is VALID [2020-07-29 01:10:15,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {938#false} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L541 {938#false} is VALID [2020-07-29 01:10:15,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {938#false} ~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {938#false} is VALID [2020-07-29 01:10:15,964 INFO L280 TraceCheckUtils]: 17: Hoare triple {938#false} assume !(1 == #valid[~p~0.base]); {938#false} is VALID [2020-07-29 01:10:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:15,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781706609] [2020-07-29 01:10:15,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:15,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:10:15,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629715760] [2020-07-29 01:10:15,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:10:15,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:15,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:10:15,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:15,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:10:15,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:15,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:10:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:10:15,994 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 7 states. [2020-07-29 01:10:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:16,573 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-07-29 01:10:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:10:16,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:10:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2020-07-29 01:10:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2020-07-29 01:10:16,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 112 transitions. [2020-07-29 01:10:16,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:16,732 INFO L225 Difference]: With dead ends: 103 [2020-07-29 01:10:16,732 INFO L226 Difference]: Without dead ends: 103 [2020-07-29 01:10:16,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:10:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-29 01:10:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-07-29 01:10:16,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:16,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 71 states. [2020-07-29 01:10:16,746 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 71 states. [2020-07-29 01:10:16,746 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 71 states. [2020-07-29 01:10:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:16,751 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-07-29 01:10:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2020-07-29 01:10:16,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:16,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:16,753 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 103 states. [2020-07-29 01:10:16,753 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 103 states. [2020-07-29 01:10:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:16,760 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2020-07-29 01:10:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2020-07-29 01:10:16,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:16,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:16,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:16,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-29 01:10:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2020-07-29 01:10:16,766 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 18 [2020-07-29 01:10:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:16,767 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2020-07-29 01:10:16,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:10:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2020-07-29 01:10:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:10:16,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:16,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:16,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:10:16,769 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1397593132, now seen corresponding path program 1 times [2020-07-29 01:10:16,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:16,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943363577] [2020-07-29 01:10:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:16,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:16,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1342#(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; {1333#true} is VALID [2020-07-29 01:10:16,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {1333#true} assume true; {1333#true} is VALID [2020-07-29 01:10:16,907 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1333#true} {1333#true} #135#return; {1333#true} is VALID [2020-07-29 01:10:16,909 INFO L263 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1342#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:16,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1342#(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; {1333#true} is VALID [2020-07-29 01:10:16,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2020-07-29 01:10:16,909 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #135#return; {1333#true} is VALID [2020-07-29 01:10:16,910 INFO L263 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret12 := main(); {1333#true} is VALID [2020-07-29 01:10:16,910 INFO L280 TraceCheckUtils]: 5: Hoare triple {1333#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {1333#true} is VALID [2020-07-29 01:10:16,910 INFO L280 TraceCheckUtils]: 6: Hoare triple {1333#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1333#true} is VALID [2020-07-29 01:10:16,911 INFO L280 TraceCheckUtils]: 7: Hoare triple {1333#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1338#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:16,912 INFO L280 TraceCheckUtils]: 8: Hoare triple {1338#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1338#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:16,913 INFO L280 TraceCheckUtils]: 9: Hoare triple {1338#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {1338#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:16,914 INFO L280 TraceCheckUtils]: 10: Hoare triple {1338#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-4 {1339#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:10:16,915 INFO L280 TraceCheckUtils]: 11: Hoare triple {1339#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:16,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0; {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:16,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L540-3 {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:16,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem7);havoc #t~mem7; {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:16,918 INFO L280 TraceCheckUtils]: 15: Hoare triple {1340#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-4 {1341#(= |main_#t~mem11| 3)} is VALID [2020-07-29 01:10:16,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {1341#(= |main_#t~mem11| 3)} assume 3 != #t~mem11;havoc #t~mem11; {1334#false} is VALID [2020-07-29 01:10:16,919 INFO L280 TraceCheckUtils]: 17: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2020-07-29 01:10:16,920 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:10:16,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943363577] [2020-07-29 01:10:16,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:16,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:10:16,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052942403] [2020-07-29 01:10:16,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:10:16,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:16,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:10:16,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:16,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:10:16,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:10:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:10:16,942 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 7 states. [2020-07-29 01:10:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:17,500 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-29 01:10:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:10:17,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:10:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2020-07-29 01:10:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2020-07-29 01:10:17,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 110 transitions. [2020-07-29 01:10:17,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:17,626 INFO L225 Difference]: With dead ends: 101 [2020-07-29 01:10:17,627 INFO L226 Difference]: Without dead ends: 101 [2020-07-29 01:10:17,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:10:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-29 01:10:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2020-07-29 01:10:17,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:17,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 75 states. [2020-07-29 01:10:17,633 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 75 states. [2020-07-29 01:10:17,633 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 75 states. [2020-07-29 01:10:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:17,637 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-29 01:10:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-29 01:10:17,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:17,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:17,638 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 101 states. [2020-07-29 01:10:17,638 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 101 states. [2020-07-29 01:10:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:17,642 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-07-29 01:10:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-07-29 01:10:17,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:17,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:17,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:17,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-29 01:10:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-07-29 01:10:17,646 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 18 [2020-07-29 01:10:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:17,646 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-07-29 01:10:17,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:10:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-07-29 01:10:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:10:17,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:17,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:17,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:10:17,648 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1397592971, now seen corresponding path program 1 times [2020-07-29 01:10:17,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:17,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702716461] [2020-07-29 01:10:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:17,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:17,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:17,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:10:17,718 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:10:17,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:10:17,731 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:10:17,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:10:17 BoogieIcfgContainer [2020-07-29 01:10:17,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:10:17,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:10:17,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:10:17,747 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:10:17,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:13" (3/4) ... [2020-07-29 01:10:17,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:10:17,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:10:17,755 INFO L168 Benchmark]: Toolchain (without parser) took 5898.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.2 MB in the beginning and 863.6 MB in the end (delta: 92.6 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:17,756 INFO L168 Benchmark]: CDTParser took 0.26 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:10:17,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -100.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:17,757 INFO L168 Benchmark]: Boogie Preprocessor took 71.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:17,758 INFO L168 Benchmark]: RCFGBuilder took 791.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 975.8 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:17,759 INFO L168 Benchmark]: TraceAbstraction took 4419.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.0 MB). Free memory was 975.8 MB in the beginning and 863.6 MB in the end (delta: 112.1 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:17,760 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.2 GB. Free memory is still 863.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:10:17,763 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.26 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 604.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -100.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 791.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 975.8 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4419.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.0 MB). Free memory was 975.8 MB in the beginning and 863.6 MB in the end (delta: 112.1 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.32 ms. Allocated memory is still 1.2 GB. Free memory is still 863.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] int flag = __VERIFIER_nondet_int(); [L522] List p, a, t; [L523] a = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L525] p = a VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND FALSE !(__VERIFIER_nondet_int()) [L537] p->h = 3 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L538] p = a VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L539] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L540] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L540] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L545] COND FALSE !(p->h != 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 78 locations, 22 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 198 SDtfs, 350 SDslu, 297 SDs, 0 SdLazy, 605 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, 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, 5 MinimizatonAttempts, 77 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 3522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:10:19,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:10:19,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:10:19,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:10:19,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:10:19,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:10:19,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:10:19,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:10:19,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:10:19,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:10:19,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:10:19,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:10:19,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:10:19,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:10:19,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:10:19,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:10:19,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:10:19,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:10:19,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:10:19,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:10:19,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:10:19,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:10:19,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:10:19,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:10:19,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:10:19,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:10:19,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:10:19,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:10:19,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:10:19,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:10:19,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:10:19,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:10:19,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:10:19,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:10:19,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:10:19,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:10:19,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:10:19,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:10:19,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:10:19,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:10:19,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:10:19,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:10:19,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:10:19,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:10:19,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:10:19,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:10:19,796 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:10:19,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:10:19,797 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:10:19,797 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:10:19,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:10:19,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:10:19,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:10:19,799 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:10:19,800 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:10:19,800 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:10:19,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:10:19,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:10:19,801 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:10:19,801 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:10:19,802 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:10:19,802 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:10:19,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:10:19,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:10:19,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:10:19,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:10:19,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:10:19,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:10:19,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:10:19,804 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:10:19,805 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:10:19,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:10:19,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:10:19,805 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> afc88cbf4886a453fed887733400308a528b9724 [2020-07-29 01:10:20,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:10:20,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:10:20,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:10:20,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:10:20,149 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:10:20,150 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2020-07-29 01:10:20,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b80224d4/b6a65770de254a638b88e5193d9c1c39/FLAGeedac42f2 [2020-07-29 01:10:20,652 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:10:20,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2020-07-29 01:10:20,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b80224d4/b6a65770de254a638b88e5193d9c1c39/FLAGeedac42f2 [2020-07-29 01:10:21,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b80224d4/b6a65770de254a638b88e5193d9c1c39 [2020-07-29 01:10:21,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:10:21,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:10:21,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:21,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:10:21,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:10:21,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b669b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21, skipping insertion in model container [2020-07-29 01:10:21,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:10:21,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:10:21,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:21,567 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:10:21,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:21,668 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:10:21,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21 WrapperNode [2020-07-29 01:10:21,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:21,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:10:21,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:10:21,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:10:21,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (1/1) ... [2020-07-29 01:10:21,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:10:21,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:10:21,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:10:21,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:10:21,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (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:10:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:10:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:10:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:10:21,825 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:10:21,825 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:10:21,825 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:10:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:10:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:10:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:10:21,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:10:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:10:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:10:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:10:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:10:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:10:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:10:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:10:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:10:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:10:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:10:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:10:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:10:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:10:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:10:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:10:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:10:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:10:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:10:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:10:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:10:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:10:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:10:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:10:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:10:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:10:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:10:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:10:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:10:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:10:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:10:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:10:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:10:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:10:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:10:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:10:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:10:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:10:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:10:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:10:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:10:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:10:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:10:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:10:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:10:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:10:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:10:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:10:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:10:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:10:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:10:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:10:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:10:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:10:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:10:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:10:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:10:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:10:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:10:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:10:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:10:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:10:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:10:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:10:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:10:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:10:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:10:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:10:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:10:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:10:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:10:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:10:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:10:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:10:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:10:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:10:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:10:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:10:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:10:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:10:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:10:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:10:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:10:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:10:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:10:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:10:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:10:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:10:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:10:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:10:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:10:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:10:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:10:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:10:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:10:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:10:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:10:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:10:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:10:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:10:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:10:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:10:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:10:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:10:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:10:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:10:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:10:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:10:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:10:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:10:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:10:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:10:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:10:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:10:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:10:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:10:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:10:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:10:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:10:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:10:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:10:22,280 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:10:22,605 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:10:22,605 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-29 01:10:22,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:22 BoogieIcfgContainer [2020-07-29 01:10:22,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:10:22,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:10:22,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:10:22,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:10:22,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:10:21" (1/3) ... [2020-07-29 01:10:22,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc289f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:22, skipping insertion in model container [2020-07-29 01:10:22,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:21" (2/3) ... [2020-07-29 01:10:22,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc289f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:22, skipping insertion in model container [2020-07-29 01:10:22,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:22" (3/3) ... [2020-07-29 01:10:22,619 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2020-07-29 01:10:22,629 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:10:22,637 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-07-29 01:10:22,651 INFO L251 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-07-29 01:10:22,673 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:10:22,674 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:10:22,674 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:10:22,674 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:10:22,674 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:10:22,675 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:10:22,675 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:10:22,675 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:10:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-29 01:10:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:22,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:22,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:22,702 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1337200692, now seen corresponding path program 1 times [2020-07-29 01:10:22,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:22,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541986316] [2020-07-29 01:10:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:22,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-29 01:10:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:22,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:22,928 INFO L263 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {64#true} is VALID [2020-07-29 01:10:22,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {64#true} is VALID [2020-07-29 01:10:22,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-29 01:10:22,930 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #156#return; {64#true} is VALID [2020-07-29 01:10:22,930 INFO L263 TraceCheckUtils]: 4: Hoare triple {64#true} call #t~ret12 := main(); {64#true} is VALID [2020-07-29 01:10:22,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {64#true} is VALID [2020-07-29 01:10:22,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {64#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {64#true} is VALID [2020-07-29 01:10:22,932 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {64#true} is VALID [2020-07-29 01:10:22,933 INFO L280 TraceCheckUtils]: 8: Hoare triple {64#true} assume !true; {65#false} is VALID [2020-07-29 01:10:22,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#false} assume !(1bv1 == #valid[~p~0.base]); {65#false} is VALID [2020-07-29 01:10:22,937 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:10:22,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:22,969 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#false} assume !(1bv1 == #valid[~p~0.base]); {65#false} is VALID [2020-07-29 01:10:22,971 INFO L280 TraceCheckUtils]: 8: Hoare triple {64#true} assume !true; {65#false} is VALID [2020-07-29 01:10:22,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {64#true} is VALID [2020-07-29 01:10:22,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {64#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {64#true} is VALID [2020-07-29 01:10:22,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {64#true} is VALID [2020-07-29 01:10:22,972 INFO L263 TraceCheckUtils]: 4: Hoare triple {64#true} call #t~ret12 := main(); {64#true} is VALID [2020-07-29 01:10:22,973 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #156#return; {64#true} is VALID [2020-07-29 01:10:22,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-29 01:10:22,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {64#true} is VALID [2020-07-29 01:10:22,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {64#true} is VALID [2020-07-29 01:10:22,975 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:10:22,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541986316] [2020-07-29 01:10:22,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:22,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-29 01:10:22,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911701166] [2020-07-29 01:10:22,984 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-29 01:10:22,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:22,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:10:23,012 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:10:23,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-29 01:10:23,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:23,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:10:23,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:10:23,026 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2020-07-29 01:10:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:23,173 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2020-07-29 01:10:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:10:23,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-29 01:10:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:10:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2020-07-29 01:10:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:10:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2020-07-29 01:10:23,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2020-07-29 01:10:23,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:23,356 INFO L225 Difference]: With dead ends: 61 [2020-07-29 01:10:23,356 INFO L226 Difference]: Without dead ends: 54 [2020-07-29 01:10:23,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:10:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-29 01:10:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-29 01:10:23,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:23,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-29 01:10:23,397 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-29 01:10:23,398 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-29 01:10:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:23,405 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:10:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:10:23,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:23,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:23,407 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-29 01:10:23,407 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-29 01:10:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:23,414 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:10:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:10:23,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:23,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:23,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:23,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:10:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-07-29 01:10:23,423 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2020-07-29 01:10:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:23,424 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-07-29 01:10:23,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-29 01:10:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:10:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:23,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:23,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:23,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:10:23,641 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1337201653, now seen corresponding path program 1 times [2020-07-29 01:10:23,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:23,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765218241] [2020-07-29 01:10:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:23,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:10:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:23,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:23,822 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:23,823 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,828 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:23,828 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,828 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:10:23,833 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:23,833 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_36|]. (= |#valid| (store |v_#valid_36| main_~a~0.base (_ bv1 1))) [2020-07-29 01:10:23,834 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| main_~a~0.base)) [2020-07-29 01:10:23,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-29 01:10:23,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {348#true} is VALID [2020-07-29 01:10:23,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-29 01:10:23,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #156#return; {348#true} is VALID [2020-07-29 01:10:23,868 INFO L263 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret12 := main(); {348#true} is VALID [2020-07-29 01:10:23,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:23,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:23,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:23,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:23,874 INFO L280 TraceCheckUtils]: 9: Hoare triple {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {349#false} is VALID [2020-07-29 01:10:23,875 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:10:23,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:23,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {349#false} is VALID [2020-07-29 01:10:23,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:23,916 INFO L280 TraceCheckUtils]: 7: Hoare triple {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {375#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:23,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:23,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {368#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:23,920 INFO L263 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret12 := main(); {348#true} is VALID [2020-07-29 01:10:23,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #156#return; {348#true} is VALID [2020-07-29 01:10:23,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-29 01:10:23,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {348#true} is VALID [2020-07-29 01:10:23,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-29 01:10:23,923 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:10:23,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765218241] [2020-07-29 01:10:23,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:23,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-29 01:10:23,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168108311] [2020-07-29 01:10:23,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:10:23,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:23,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:10:23,943 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:10:23,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:10:23,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:10:23,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:10:23,945 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2020-07-29 01:10:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:24,383 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2020-07-29 01:10:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:10:24,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:10:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-29 01:10:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-29 01:10:24,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-29 01:10:24,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:24,529 INFO L225 Difference]: With dead ends: 61 [2020-07-29 01:10:24,529 INFO L226 Difference]: Without dead ends: 61 [2020-07-29 01:10:24,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-29 01:10:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2020-07-29 01:10:24,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:24,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 56 states. [2020-07-29 01:10:24,536 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 56 states. [2020-07-29 01:10:24,537 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 56 states. [2020-07-29 01:10:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:24,541 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2020-07-29 01:10:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2020-07-29 01:10:24,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:24,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:24,542 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 61 states. [2020-07-29 01:10:24,543 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 61 states. [2020-07-29 01:10:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:24,547 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2020-07-29 01:10:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2020-07-29 01:10:24,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:24,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:24,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:24,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 01:10:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2020-07-29 01:10:24,552 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 10 [2020-07-29 01:10:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:24,552 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2020-07-29 01:10:24,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:10:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2020-07-29 01:10:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:24,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:24,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:24,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:10:24,771 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1337201652, now seen corresponding path program 1 times [2020-07-29 01:10:24,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:24,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140652270] [2020-07-29 01:10:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:24,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:10:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:24,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:24,894 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:24,895 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:24,900 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:24,901 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:24,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:10:24,905 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:24,905 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_28|]. (and (= (store |v_#length_28| main_~a~0.base (_ bv8 32)) |#length|) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:10:24,906 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~a~0.base) (_ bv8 32)) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:10:24,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {652#true} call ULTIMATE.init(); {652#true} is VALID [2020-07-29 01:10:24,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {652#true} is VALID [2020-07-29 01:10:24,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {652#true} assume true; {652#true} is VALID [2020-07-29 01:10:24,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} #156#return; {652#true} is VALID [2020-07-29 01:10:24,946 INFO L263 TraceCheckUtils]: 4: Hoare triple {652#true} call #t~ret12 := main(); {652#true} is VALID [2020-07-29 01:10:24,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {652#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {672#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:10:24,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {672#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {672#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:10:24,950 INFO L280 TraceCheckUtils]: 7: Hoare triple {672#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {679#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:10:24,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {679#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {679#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:10:24,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {679#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} assume !((~bvule32(~bvadd32(4bv32, ~p~0.offset), #length[~p~0.base]) && ~bvule32(~p~0.offset, ~bvadd32(4bv32, ~p~0.offset))) && ~bvule32(0bv32, ~p~0.offset)); {653#false} is VALID [2020-07-29 01:10:24,953 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:10:24,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:25,160 INFO L280 TraceCheckUtils]: 9: Hoare triple {686#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~p~0.offset), #length[~p~0.base]) && ~bvule32(~p~0.offset, ~bvadd32(4bv32, ~p~0.offset))) && ~bvule32(0bv32, ~p~0.offset)); {653#false} is VALID [2020-07-29 01:10:25,166 INFO L280 TraceCheckUtils]: 8: Hoare triple {686#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {686#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:25,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {693#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {686#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:25,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {693#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {693#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:25,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {652#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {693#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:25,171 INFO L263 TraceCheckUtils]: 4: Hoare triple {652#true} call #t~ret12 := main(); {652#true} is VALID [2020-07-29 01:10:25,171 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} #156#return; {652#true} is VALID [2020-07-29 01:10:25,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {652#true} assume true; {652#true} is VALID [2020-07-29 01:10:25,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {652#true} is VALID [2020-07-29 01:10:25,172 INFO L263 TraceCheckUtils]: 0: Hoare triple {652#true} call ULTIMATE.init(); {652#true} is VALID [2020-07-29 01:10:25,173 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:10:25,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140652270] [2020-07-29 01:10:25,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:25,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-29 01:10:25,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936221281] [2020-07-29 01:10:25,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:10:25,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:25,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:25,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:25,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:25,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:25,202 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 6 states. [2020-07-29 01:10:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:26,098 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-29 01:10:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:26,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:10:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2020-07-29 01:10:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2020-07-29 01:10:26,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 91 transitions. [2020-07-29 01:10:26,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:26,357 INFO L225 Difference]: With dead ends: 73 [2020-07-29 01:10:26,357 INFO L226 Difference]: Without dead ends: 73 [2020-07-29 01:10:26,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-29 01:10:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2020-07-29 01:10:26,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:26,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 63 states. [2020-07-29 01:10:26,364 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 63 states. [2020-07-29 01:10:26,365 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 63 states. [2020-07-29 01:10:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:26,370 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-29 01:10:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-29 01:10:26,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:26,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:26,374 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 73 states. [2020-07-29 01:10:26,374 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 73 states. [2020-07-29 01:10:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:26,382 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-07-29 01:10:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-07-29 01:10:26,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:26,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:26,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:26,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-29 01:10:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2020-07-29 01:10:26,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 10 [2020-07-29 01:10:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:26,387 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2020-07-29 01:10:26,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-07-29 01:10:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:10:26,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:26,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:26,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:10:26,608 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2081498834, now seen corresponding path program 1 times [2020-07-29 01:10:26,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:26,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712240305] [2020-07-29 01:10:26,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:26,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:10:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:26,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:26,751 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:26,751 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,754 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,755 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,755 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-29 01:10:26,805 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:10:26,807 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,809 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,809 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-07-29 01:10:26,812 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:26,812 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= .cse0 |main_#t~mem11|) (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)))) [2020-07-29 01:10:26,813 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem11| (_ bv4294967293 32))) [2020-07-29 01:10:26,826 INFO L263 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2020-07-29 01:10:26,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {1003#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1003#true} is VALID [2020-07-29 01:10:26,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2020-07-29 01:10:26,827 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #156#return; {1003#true} is VALID [2020-07-29 01:10:26,828 INFO L263 TraceCheckUtils]: 4: Hoare triple {1003#true} call #t~ret12 := main(); {1003#true} is VALID [2020-07-29 01:10:26,828 INFO L280 TraceCheckUtils]: 5: Hoare triple {1003#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {1003#true} is VALID [2020-07-29 01:10:26,828 INFO L280 TraceCheckUtils]: 6: Hoare triple {1003#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1003#true} is VALID [2020-07-29 01:10:26,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {1003#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:26,835 INFO L280 TraceCheckUtils]: 8: Hoare triple {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:26,837 INFO L280 TraceCheckUtils]: 9: Hoare triple {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L526-3 {1036#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {1036#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967293 32)) (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 != ~flag~0; {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} SUMMARY for call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L540-3 {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} SUMMARY for call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L543-4 {1053#(= (_ bv3 32) |main_#t~mem11|)} is VALID [2020-07-29 01:10:26,841 INFO L280 TraceCheckUtils]: 15: Hoare triple {1053#(= (_ bv3 32) |main_#t~mem11|)} assume 3bv32 != #t~mem11;havoc #t~mem11; {1004#false} is VALID [2020-07-29 01:10:26,841 INFO L280 TraceCheckUtils]: 16: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2020-07-29 01:10:26,842 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:10:26,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:26,885 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2020-07-29 01:10:26,907 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-29 01:10:26,915 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,915 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:10:26,915 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:7 [2020-07-29 01:10:26,921 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:26,921 WARN L407 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (= (_ bv0 32) (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967293 32))) [2020-07-29 01:10:26,921 WARN L408 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2020-07-29 01:10:26,937 INFO L280 TraceCheckUtils]: 16: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2020-07-29 01:10:26,938 INFO L280 TraceCheckUtils]: 15: Hoare triple {1053#(= (_ bv3 32) |main_#t~mem11|)} assume 3bv32 != #t~mem11;havoc #t~mem11; {1004#false} is VALID [2020-07-29 01:10:26,939 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} SUMMARY for call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L543-4 {1053#(= (_ bv3 32) |main_#t~mem11|)} is VALID [2020-07-29 01:10:26,939 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} SUMMARY for call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L540-3 {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 != ~flag~0; {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {1036#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967293 32)) (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1040#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L526-3 {1036#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:26,943 INFO L280 TraceCheckUtils]: 8: Hoare triple {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:26,944 INFO L280 TraceCheckUtils]: 7: Hoare triple {1003#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1029#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:26,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {1003#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1003#true} is VALID [2020-07-29 01:10:26,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {1003#true} ~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {1003#true} is VALID [2020-07-29 01:10:26,944 INFO L263 TraceCheckUtils]: 4: Hoare triple {1003#true} call #t~ret12 := main(); {1003#true} is VALID [2020-07-29 01:10:26,944 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #156#return; {1003#true} is VALID [2020-07-29 01:10:26,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2020-07-29 01:10:26,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {1003#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1003#true} is VALID [2020-07-29 01:10:26,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2020-07-29 01:10:26,946 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:10:26,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712240305] [2020-07-29 01:10:26,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:26,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-07-29 01:10:26,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750086022] [2020-07-29 01:10:26,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:10:26,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:26,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:26,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:26,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:26,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:26,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:26,970 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2020-07-29 01:10:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:27,843 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2020-07-29 01:10:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:10:27,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:10:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2020-07-29 01:10:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2020-07-29 01:10:27,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2020-07-29 01:10:28,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:28,046 INFO L225 Difference]: With dead ends: 106 [2020-07-29 01:10:28,047 INFO L226 Difference]: Without dead ends: 106 [2020-07-29 01:10:28,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-29 01:10:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 71. [2020-07-29 01:10:28,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:28,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 71 states. [2020-07-29 01:10:28,061 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 71 states. [2020-07-29 01:10:28,062 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 71 states. [2020-07-29 01:10:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:28,067 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2020-07-29 01:10:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2020-07-29 01:10:28,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:28,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:28,074 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 106 states. [2020-07-29 01:10:28,074 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 106 states. [2020-07-29 01:10:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:28,083 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2020-07-29 01:10:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2020-07-29 01:10:28,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:28,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:28,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:28,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-29 01:10:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2020-07-29 01:10:28,088 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 17 [2020-07-29 01:10:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:28,088 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2020-07-29 01:10:28,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-07-29 01:10:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:10:28,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:28,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:28,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:10:28,301 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:10:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2081498995, now seen corresponding path program 1 times [2020-07-29 01:10:28,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:28,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739204973] [2020-07-29 01:10:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:28,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:28,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:28,458 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-29 01:10:28,459 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:10:28,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:10:28,673 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:10:28,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:10:28 BoogieIcfgContainer [2020-07-29 01:10:28,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:10:28,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:10:28,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:10:28,698 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:10:28,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:22" (3/4) ... [2020-07-29 01:10:28,701 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:10:28,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:10:28,702 INFO L168 Benchmark]: Toolchain (without parser) took 7652.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 953.5 MB in the beginning and 913.7 MB in the end (delta: 39.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:28,703 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:10:28,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:28,704 INFO L168 Benchmark]: Boogie Preprocessor took 80.80 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:10:28,705 INFO L168 Benchmark]: RCFGBuilder took 859.09 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: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:28,706 INFO L168 Benchmark]: TraceAbstraction took 6085.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 138.5 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:28,707 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 913.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:10:28,710 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.80 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. * RCFGBuilder took 859.09 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: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6085.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 138.5 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 913.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] int flag = __VERIFIER_nondet_int(); [L522] List p, a, t; [L523] a = (List) malloc(sizeof(struct node)) VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}] [L524] COND FALSE !(a == 0) VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}] [L525] p = a VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}, p={1:0}] [L526] COND FALSE !(__VERIFIER_nondet_int()) [L537] p->h = 3 VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}, p={1:0}] [L538] p = a VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}, p={1:0}] [L539] COND TRUE \read(flag) VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}, p={1:0}] [L540] EXPR p->h VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=3] [L540] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={1:0}, flag=2147483648, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=3] [L545] COND FALSE !(p->h != 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 83 locations, 22 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 161 SDtfs, 279 SDslu, 177 SDs, 0 SdLazy, 224 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, 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, 50 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 3770 SizeOfPredicates, 16 NumberOfNonLiveVariables, 194 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...