./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/memsafety-ext3/getNumbers1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae33a6a64877fc5c824e4d2dbc13817f946c171e566de8189cdbc86c749355b6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:45,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:45,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:45,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:45,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:45,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:45,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:45,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:45,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:45,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:45,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:45,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:45,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:45,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:45,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:45,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:45,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:45,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:45,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:45,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:45,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:45,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:45,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:45,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:45,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:45,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:45,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:45,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:45,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:45,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:45,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:45,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:45,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:45,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:45,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:45,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:45,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:45,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:45,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:45,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:45,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:45,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:45,880 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:45,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:45,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:45,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:45,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:45,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:45,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:45,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:45,883 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:45,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:45,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:45,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:45,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:45,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:45,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:45,884 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:45,884 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:45,884 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:45,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:45,885 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:45,885 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:45,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:45,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:45,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:45,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:45,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:45,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:45,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:45,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:45,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:45,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ae33a6a64877fc5c824e4d2dbc13817f946c171e566de8189cdbc86c749355b6 [2022-02-21 00:02:46,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:46,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:46,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:46,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:46,128 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:46,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c [2022-02-21 00:02:46,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4b96e46/4bfb116705684680bd41123c2a6aca5f/FLAGc5a5394da [2022-02-21 00:02:46,535 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:46,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c [2022-02-21 00:02:46,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4b96e46/4bfb116705684680bd41123c2a6aca5f/FLAGc5a5394da [2022-02-21 00:02:46,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4b96e46/4bfb116705684680bd41123c2a6aca5f [2022-02-21 00:02:46,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:46,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:46,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:46,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:46,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:46,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c18eab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46, skipping insertion in model container [2022-02-21 00:02:46,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:46,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:47,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:47,216 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:47,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:47,250 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:47,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47 WrapperNode [2022-02-21 00:02:47,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:47,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:47,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:47,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:47,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,287 INFO L137 Inliner]: procedures = 12, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-02-21 00:02:47,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:47,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:47,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:47,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:47,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:47,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:47,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:47,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:47,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (1/1) ... [2022-02-21 00:02:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:47,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 00:02:47,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 00:02:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:02:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:02:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 00:02:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:02:47,427 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:47,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:47,572 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:47,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:47,582 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 00:02:47,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:47 BoogieIcfgContainer [2022-02-21 00:02:47,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:47,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:47,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:47,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:47,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:46" (1/3) ... [2022-02-21 00:02:47,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584c2d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:47, skipping insertion in model container [2022-02-21 00:02:47,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:47" (2/3) ... [2022-02-21 00:02:47,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584c2d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:47, skipping insertion in model container [2022-02-21 00:02:47,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:47" (3/3) ... [2022-02-21 00:02:47,612 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers1-1.c [2022-02-21 00:02:47,618 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:47,625 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-02-21 00:02:47,658 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:47,664 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 00:02:47,665 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-21 00:02:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:47,682 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:47,683 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 00:02:47,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767438436] [2022-02-21 00:02:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {23#true} is VALID [2022-02-21 00:02:47,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {25#(= (select |#valid| |ULTIMATE.start_getNumbers_~array~0#1.base|) 1)} is VALID [2022-02-21 00:02:47,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(= (select |#valid| |ULTIMATE.start_getNumbers_~array~0#1.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {25#(= (select |#valid| |ULTIMATE.start_getNumbers_~array~0#1.base|) 1)} is VALID [2022-02-21 00:02:47,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#(= (select |#valid| |ULTIMATE.start_getNumbers_~array~0#1.base|) 1)} assume !(1 == #valid[getNumbers_~array~0#1.base]); {24#false} is VALID [2022-02-21 00:02:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:47,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767438436] [2022-02-21 00:02:47,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767438436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,869 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:47,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635563962] [2022-02-21 00:02:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:47,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,906 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,987 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-21 00:02:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:47,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 00:02:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 00:02:47,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 00:02:48,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,037 INFO L225 Difference]: With dead ends: 19 [2022-02-21 00:02:48,038 INFO L226 Difference]: Without dead ends: 17 [2022-02-21 00:02:48,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:48,046 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:48,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-21 00:02:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 00:02:48,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:48,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,069 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,069 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,071 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-21 00:02:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-21 00:02:48,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-21 00:02:48,073 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-21 00:02:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,074 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-21 00:02:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-21 00:02:48,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:48,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-21 00:02:48,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 4 [2022-02-21 00:02:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:48,087 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-21 00:02:48,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-21 00:02:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:48,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:48,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:48,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:48,089 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-21 00:02:48,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:48,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715323527] [2022-02-21 00:02:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {98#true} is VALID [2022-02-21 00:02:48,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {100#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {100#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {99#false} is VALID [2022-02-21 00:02:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:48,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715323527] [2022-02-21 00:02:48,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715323527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:48,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:48,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:48,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089830044] [2022-02-21 00:02:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:48,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:48,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:48,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:48,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:48,158 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,196 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 00:02:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:48,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 00:02:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 00:02:48,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 00:02:48,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,222 INFO L225 Difference]: With dead ends: 20 [2022-02-21 00:02:48,222 INFO L226 Difference]: Without dead ends: 20 [2022-02-21 00:02:48,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:48,224 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:48,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:48,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-21 00:02:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 00:02:48,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:48,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,228 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,228 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,229 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 00:02:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 00:02:48,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 00:02:48,231 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 00:02:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,232 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 00:02:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 00:02:48,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:48,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-21 00:02:48,234 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2022-02-21 00:02:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:48,235 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-21 00:02:48,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-21 00:02:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:02:48,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:48,236 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-02-21 00:02:48,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:48,236 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2022-02-21 00:02:48,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:48,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471171544] [2022-02-21 00:02:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {182#true} is VALID [2022-02-21 00:02:48,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {185#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:48,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} assume !!(getNumbers_~i~0#1 < 10); {185#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:48,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {183#false} is VALID [2022-02-21 00:02:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:48,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471171544] [2022-02-21 00:02:48,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471171544] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:48,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858756179] [2022-02-21 00:02:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:48,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:48,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:48,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 00:02:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 00:02:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:48,583 INFO L390 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 [2022-02-21 00:02:48,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {182#true} is VALID [2022-02-21 00:02:48,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {184#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {201#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {201#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {183#false} is VALID [2022-02-21 00:02:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:48,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {183#false} is VALID [2022-02-21 00:02:48,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {208#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:48,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {208#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:48,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {215#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {215#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:48,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {215#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:48,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {215#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:48,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {182#true} is VALID [2022-02-21 00:02:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858756179] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:48,845 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:48,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 00:02:48,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161915006] [2022-02-21 00:02:48,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:02:48,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:48,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 00:02:48,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 00:02:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:02:48,865 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,073 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-21 00:02:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:02:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:02:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-21 00:02:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-21 00:02:49,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-21 00:02:49,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:49,145 INFO L225 Difference]: With dead ends: 50 [2022-02-21 00:02:49,145 INFO L226 Difference]: Without dead ends: 50 [2022-02-21 00:02:49,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:02:49,158 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:49,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:02:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-21 00:02:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 28. [2022-02-21 00:02:49,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:49,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,166 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,167 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,174 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-21 00:02:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-02-21 00:02:49,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-21 00:02:49,176 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-21 00:02:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,184 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-21 00:02:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-02-21 00:02:49,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:49,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-02-21 00:02:49,188 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 7 [2022-02-21 00:02:49,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,188 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-02-21 00:02:49,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-21 00:02:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 00:02:49,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,190 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:49,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:49,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:49,414 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1612520618, now seen corresponding path program 1 times [2022-02-21 00:02:49,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906339269] [2022-02-21 00:02:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {407#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {407#true} is VALID [2022-02-21 00:02:49,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !(getNumbers_~i~0#1 < 10); {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.base| |ULTIMATE.start_getNumbers_#t~malloc0#1.base|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {410#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} is VALID [2022-02-21 00:02:49,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {411#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {411#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {411#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !(4 + (main_~numbers~0#1.offset + 4 * main_~i~1#1) <= #length[main_~numbers~0#1.base] && 0 <= main_~numbers~0#1.offset + 4 * main_~i~1#1); {408#false} is VALID [2022-02-21 00:02:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 00:02:49,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906339269] [2022-02-21 00:02:49,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906339269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:49,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:49,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:02:49,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598614915] [2022-02-21 00:02:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:49,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 00:02:49,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:49,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:49,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:02:49,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:02:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:02:49,581 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,683 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 00:02:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:02:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 00:02:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 00:02:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 00:02:49,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-21 00:02:49,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:49,721 INFO L225 Difference]: With dead ends: 33 [2022-02-21 00:02:49,721 INFO L226 Difference]: Without dead ends: 33 [2022-02-21 00:02:49,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:02:49,722 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:49,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-21 00:02:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-02-21 00:02:49,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:49,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,725 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,725 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,727 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 00:02:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-21 00:02:49,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-21 00:02:49,727 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-21 00:02:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,729 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 00:02:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-21 00:02:49,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:49,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-21 00:02:49,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2022-02-21 00:02:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,732 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-21 00:02:49,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-21 00:02:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 00:02:49,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,733 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:49,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:49,733 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1612520617, now seen corresponding path program 1 times [2022-02-21 00:02:49,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885209552] [2022-02-21 00:02:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {545#true} is VALID [2022-02-21 00:02:49,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {547#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:49,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {547#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:49,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {547#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {547#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:49,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {547#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:49,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:49,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:49,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {549#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:49,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !(getNumbers_~i~0#1 < 10); {546#false} is VALID [2022-02-21 00:02:49,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {546#false} is VALID [2022-02-21 00:02:49,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#false} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {546#false} is VALID [2022-02-21 00:02:49,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {546#false} is VALID [2022-02-21 00:02:49,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#false} assume !(1 == #valid[main_~numbers~0#1.base]); {546#false} is VALID [2022-02-21 00:02:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:49,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885209552] [2022-02-21 00:02:49,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885209552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:49,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767772759] [2022-02-21 00:02:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:49,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:49,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:49,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 00:02:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 00:02:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:49,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {545#true} is VALID [2022-02-21 00:02:49,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {556#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:49,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {556#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:49,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {556#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {556#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:49,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {556#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:49,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:49,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:49,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {549#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:49,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !(getNumbers_~i~0#1 < 10); {546#false} is VALID [2022-02-21 00:02:49,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {546#false} is VALID [2022-02-21 00:02:49,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#false} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {546#false} is VALID [2022-02-21 00:02:49,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {546#false} is VALID [2022-02-21 00:02:49,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#false} assume !(1 == #valid[main_~numbers~0#1.base]); {546#false} is VALID [2022-02-21 00:02:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:49,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:50,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#false} assume !(1 == #valid[main_~numbers~0#1.base]); {546#false} is VALID [2022-02-21 00:02:50,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#false} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {546#false} is VALID [2022-02-21 00:02:50,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#false} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {546#false} is VALID [2022-02-21 00:02:50,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {546#false} is VALID [2022-02-21 00:02:50,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {602#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} assume !(getNumbers_~i~0#1 < 10); {546#false} is VALID [2022-02-21 00:02:50,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {602#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} is VALID [2022-02-21 00:02:50,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {606#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {606#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:50,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {606#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} assume !!(getNumbers_~i~0#1 < 10); {606#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:50,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {616#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {606#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:50,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {616#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {616#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:50,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} assume !!(getNumbers_~i~0#1 < 10); {616#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:50,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {616#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:50,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {545#true} is VALID [2022-02-21 00:02:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:50,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767772759] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:50,019 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:50,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-21 00:02:50,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356809810] [2022-02-21 00:02:50,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:50,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 00:02:50,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:50,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:50,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 00:02:50,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 00:02:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:02:50,041 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,132 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-21 00:02:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:02:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 00:02:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-02-21 00:02:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-02-21 00:02:50,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-02-21 00:02:50,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:50,167 INFO L225 Difference]: With dead ends: 36 [2022-02-21 00:02:50,167 INFO L226 Difference]: Without dead ends: 36 [2022-02-21 00:02:50,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:02:50,168 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:50,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-21 00:02:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-02-21 00:02:50,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:50,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,175 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,175 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,177 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-21 00:02:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-21 00:02:50,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:50,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:50,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 00:02:50,178 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 00:02:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,179 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-21 00:02:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-21 00:02:50,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:50,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:50,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:50,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-02-21 00:02:50,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 13 [2022-02-21 00:02:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:50,185 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-02-21 00:02:50,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-21 00:02:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 00:02:50,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:50,190 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2022-02-21 00:02:50,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-21 00:02:50,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:50,400 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash -116849082, now seen corresponding path program 2 times [2022-02-21 00:02:50,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:50,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544002618] [2022-02-21 00:02:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:50,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {771#true} is VALID [2022-02-21 00:02:50,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {774#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:50,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} assume !!(getNumbers_~i~0#1 < 10); {774#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:50,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {774#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:50,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {775#(and (<= (+ 32 (* |ULTIMATE.start_getNumbers_~i~0#1| 4)) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:50,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= (+ 32 (* |ULTIMATE.start_getNumbers_~i~0#1| 4)) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {775#(and (<= (+ 32 (* |ULTIMATE.start_getNumbers_~i~0#1| 4)) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:50,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= (+ 32 (* |ULTIMATE.start_getNumbers_~i~0#1| 4)) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {775#(and (<= (+ 32 (* |ULTIMATE.start_getNumbers_~i~0#1| 4)) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:50,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#(and (<= (+ 32 (* |ULTIMATE.start_getNumbers_~i~0#1| 4)) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {776#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {776#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {776#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {777#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:50,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {777#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {777#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:50,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {772#false} is VALID [2022-02-21 00:02:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:50,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:50,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544002618] [2022-02-21 00:02:50,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544002618] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:50,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201771183] [2022-02-21 00:02:50,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:02:50,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:50,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:50,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:50,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 00:02:50,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:02:50,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:02:50,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 00:02:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:50,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:50,671 INFO L390 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 [2022-02-21 00:02:50,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {771#true} is VALID [2022-02-21 00:02:50,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {773#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {793#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {793#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {793#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {793#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {793#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {803#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (= (+ (- 2) |ULTIMATE.start_getNumbers_~i~0#1|) 0))} is VALID [2022-02-21 00:02:50,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {803#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (= (+ (- 2) |ULTIMATE.start_getNumbers_~i~0#1|) 0))} assume !!(getNumbers_~i~0#1 < 10); {803#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (= (+ (- 2) |ULTIMATE.start_getNumbers_~i~0#1|) 0))} is VALID [2022-02-21 00:02:50,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {803#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (= (+ (- 2) |ULTIMATE.start_getNumbers_~i~0#1|) 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {803#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (= (+ (- 2) |ULTIMATE.start_getNumbers_~i~0#1|) 0))} is VALID [2022-02-21 00:02:50,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {803#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (= (+ (- 2) |ULTIMATE.start_getNumbers_~i~0#1|) 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {813#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 3) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {813#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 3) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {813#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 3) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {813#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 3) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {813#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 3) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {813#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 3) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {823#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 4) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 4) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {823#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 4) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {823#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (= (+ (- 4) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {772#false} is VALID [2022-02-21 00:02:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:50,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:51,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {830#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {772#false} is VALID [2022-02-21 00:02:51,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {830#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {830#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {837#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {837#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {847#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {837#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 4 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {847#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {847#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {847#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {847#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {847#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 8 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {857#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {857#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:51,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {857#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} assume !!(getNumbers_~i~0#1 < 10); {857#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:51,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {867#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 20 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {857#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 12 |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)))} is VALID [2022-02-21 00:02:51,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {867#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 20 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {867#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 20 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 20 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {867#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 20 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {867#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 20 |ULTIMATE.start_getNumbers_~array~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) 16 |ULTIMATE.start_getNumbers_~array~0#1.offset|)))} is VALID [2022-02-21 00:02:51,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {771#true} is VALID [2022-02-21 00:02:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:51,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201771183] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:51,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:51,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-02-21 00:02:51,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478968571] [2022-02-21 00:02:51,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 00:02:51,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:51,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 00:02:51,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:51,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 00:02:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-02-21 00:02:51,273 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,821 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-02-21 00:02:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:02:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 00:02:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-02-21 00:02:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-02-21 00:02:51,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 101 transitions. [2022-02-21 00:02:51,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,915 INFO L225 Difference]: With dead ends: 100 [2022-02-21 00:02:51,915 INFO L226 Difference]: Without dead ends: 100 [2022-02-21 00:02:51,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2022-02-21 00:02:51,916 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 131 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:51,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 99 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:02:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-21 00:02:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 48. [2022-02-21 00:02:51,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:51,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,920 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,920 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,923 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-02-21 00:02:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-02-21 00:02:51,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 100 states. [2022-02-21 00:02:51,923 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 100 states. [2022-02-21 00:02:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,926 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-02-21 00:02:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-02-21 00:02:51,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:51,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-02-21 00:02:51,928 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 16 [2022-02-21 00:02:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:51,928 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-02-21 00:02:51,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-21 00:02:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:51,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:51,929 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:51,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:52,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:52,154 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -603654487, now seen corresponding path program 2 times [2022-02-21 00:02:52,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:52,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609070261] [2022-02-21 00:02:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:52,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {1235#true} is VALID [2022-02-21 00:02:52,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {1237#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:52,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {1237#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {1237#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:52,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {1237#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1237#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:52,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {1237#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:52,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:52,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:52,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:52,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !!(getNumbers_~i~0#1 < 10); {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:52,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:52,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !!(getNumbers_~i~0#1 < 10); {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} assume !!(getNumbers_~i~0#1 < 10); {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:52,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} assume !(getNumbers_~i~0#1 < 10); {1236#false} is VALID [2022-02-21 00:02:52,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {1236#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {1236#false} is VALID [2022-02-21 00:02:52,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {1236#false} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {1236#false} is VALID [2022-02-21 00:02:52,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {1236#false} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {1236#false} is VALID [2022-02-21 00:02:52,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {1236#false} assume !(1 == #valid[main_~numbers~0#1.base]); {1236#false} is VALID [2022-02-21 00:02:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:52,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:52,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609070261] [2022-02-21 00:02:52,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609070261] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:52,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578869395] [2022-02-21 00:02:52,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:02:52,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:52,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:52,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 00:02:52,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:02:52,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:02:52,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 00:02:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:52,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:52,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {1235#true} is VALID [2022-02-21 00:02:52,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {1250#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:52,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1250#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {1250#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:52,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {1250#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1250#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:52,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {1250#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:52,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:52,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:52,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:52,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !!(getNumbers_~i~0#1 < 10); {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:52,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:52,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !!(getNumbers_~i~0#1 < 10); {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} assume !!(getNumbers_~i~0#1 < 10); {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:52,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} assume !(getNumbers_~i~0#1 < 10); {1236#false} is VALID [2022-02-21 00:02:52,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {1236#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {1236#false} is VALID [2022-02-21 00:02:52,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {1236#false} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {1236#false} is VALID [2022-02-21 00:02:52,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {1236#false} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {1236#false} is VALID [2022-02-21 00:02:52,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {1236#false} assume !(1 == #valid[main_~numbers~0#1.base]); {1236#false} is VALID [2022-02-21 00:02:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:52,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:52,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {1236#false} assume !(1 == #valid[main_~numbers~0#1.base]); {1236#false} is VALID [2022-02-21 00:02:52,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {1236#false} assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1; {1236#false} is VALID [2022-02-21 00:02:52,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {1236#false} main_#t~ret2#1.base, main_#t~ret2#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~ret2#1.base, main_#t~ret2#1.offset;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset;main_~i~1#1 := 0; {1236#false} is VALID [2022-02-21 00:02:52,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {1236#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; {1236#false} is VALID [2022-02-21 00:02:52,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {1332#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} assume !(getNumbers_~i~0#1 < 10); {1236#false} is VALID [2022-02-21 00:02:52,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {1336#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1332#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} is VALID [2022-02-21 00:02:52,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1336#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:52,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {1336#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} assume !!(getNumbers_~i~0#1 < 10); {1336#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:52,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {1346#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1336#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:52,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1346#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1346#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:52,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1346#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} assume !!(getNumbers_~i~0#1 < 10); {1346#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:52,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1346#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:52,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:52,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} assume !!(getNumbers_~i~0#1 < 10); {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:52,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1243#(<= |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:52,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} assume !!(getNumbers_~i~0#1 < 10); {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1242#(<= |ULTIMATE.start_getNumbers_~i~0#1| 5)} is VALID [2022-02-21 00:02:52,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !!(getNumbers_~i~0#1 < 10); {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1241#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:52,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {1240#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:52,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {1235#true} is VALID [2022-02-21 00:02:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:52,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578869395] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:52,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:52,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-21 00:02:52,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859790008] [2022-02-21 00:02:52,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:52,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:52,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:52,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:52,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:02:52,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:02:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:52,749 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,830 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-21 00:02:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:02:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-02-21 00:02:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-02-21 00:02:52,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2022-02-21 00:02:52,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:52,870 INFO L225 Difference]: With dead ends: 48 [2022-02-21 00:02:52,870 INFO L226 Difference]: Without dead ends: 48 [2022-02-21 00:02:52,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:52,871 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:52,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-21 00:02:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-21 00:02:52,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:52,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,875 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,875 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,876 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-21 00:02:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-21 00:02:52,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 00:02:52,877 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-21 00:02:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,878 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-21 00:02:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-21 00:02:52,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:52,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-02-21 00:02:52,879 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 25 [2022-02-21 00:02:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:52,880 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-02-21 00:02:52,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-21 00:02:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-21 00:02:52,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:52,881 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1] [2022-02-21 00:02:52,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:53,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:53,104 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:53,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1565294406, now seen corresponding path program 3 times [2022-02-21 00:02:53,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:53,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394476827] [2022-02-21 00:02:53,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {1586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {1586#true} is VALID [2022-02-21 00:02:53,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {1586#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {1588#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1588#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1588#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {1588#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1588#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {1588#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1589#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1589#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1589#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {1589#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1589#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {1589#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1590#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {1590#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1590#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {1590#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1590#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {1590#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1591#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {1591#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1591#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {1591#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1591#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {1591#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1592#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {1592#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1592#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {1592#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1592#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {1592#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1593#(and (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {1593#(and (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1593#(and (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {1593#(and (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1593#(and (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {1593#(and (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1594#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {1594#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1594#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {1594#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1594#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {1594#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1595#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {1595#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1595#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {1595#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1595#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1595#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1596#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {1596#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1596#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {1596#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1596#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:02:53,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1597#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {1597#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1597#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {1597#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1597#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {1597#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1598#(and (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {1598#(and (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1587#false} is VALID [2022-02-21 00:02:53,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {1587#false} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {1587#false} is VALID [2022-02-21 00:02:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 127 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:53,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:53,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394476827] [2022-02-21 00:02:53,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394476827] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:53,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983924931] [2022-02-21 00:02:53,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 00:02:53,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:53,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:53,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:53,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 00:02:53,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 00:02:53,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:02:53,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:02:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:53,497 INFO L390 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 [2022-02-21 00:02:53,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {1586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1); {1586#true} is VALID [2022-02-21 00:02:53,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {1586#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret2#1.base, main_#t~ret2#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~post3#1, main_~i~1#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset, getNumbers_#t~pre1#1, getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset;call getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset := #Ultimate.allocOnStack(40);getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset := getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset;getNumbers_~i~0#1 := 0; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {1605#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, getNumbers_~array~0#1.base, getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L11 {1693#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {1693#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |ULTIMATE.start_getNumbers_~array~0#1.offset|)) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} getNumbers_#t~pre1#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre1#1; {1697#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= (+ (div |ULTIMATE.start_getNumbers_~array~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers_~i~0#1|) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {1697#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= (+ (div |ULTIMATE.start_getNumbers_~array~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers_~i~0#1|) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1701#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= (+ (div |ULTIMATE.start_getNumbers_~array~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers_~i~0#1|) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (< |ULTIMATE.start_getNumbers_~i~0#1| 10))} is VALID [2022-02-21 00:02:53,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {1701#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers_~array~0#1.base|)) (<= (+ (div |ULTIMATE.start_getNumbers_~array~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers_~i~0#1|) (<= |ULTIMATE.start_getNumbers_~array~0#1.offset| 0) (< |ULTIMATE.start_getNumbers_~i~0#1| 10))} assume !(4 + (getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1) <= #length[getNumbers_~array~0#1.base] && 0 <= getNumbers_~array~0#1.offset + 4 * getNumbers_~i~0#1); {1587#false} is VALID [2022-02-21 00:02:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-21 00:02:53,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:53,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983924931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:53,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:02:53,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-02-21 00:02:53,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301705851] [2022-02-21 00:02:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-21 00:02:53,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:53,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:53,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:02:53,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:02:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2022-02-21 00:02:53,856 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,914 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-21 00:02:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:02:53,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-21 00:02:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 00:02:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 00:02:53,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-02-21 00:02:53,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:53,941 INFO L225 Difference]: With dead ends: 47 [2022-02-21 00:02:53,941 INFO L226 Difference]: Without dead ends: 47 [2022-02-21 00:02:53,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2022-02-21 00:02:53,942 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:53,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 18 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-21 00:02:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-02-21 00:02:53,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:53,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,952 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,952 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,953 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-21 00:02:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-21 00:02:53,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-21 00:02:53,954 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-21 00:02:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,955 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-21 00:02:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-21 00:02:53,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-02-21 00:02:53,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 34 [2022-02-21 00:02:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:53,957 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-02-21 00:02:53,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-02-21 00:02:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 00:02:53,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:53,958 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:53,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:54,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:54,172 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:02:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 3 times [2022-02-21 00:02:54,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:54,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909008530] [2022-02-21 00:02:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:54,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:02:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:54,293 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:02:54,293 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:02:54,294 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (4 of 5 remaining) [2022-02-21 00:02:54,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (3 of 5 remaining) [2022-02-21 00:02:54,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (2 of 5 remaining) [2022-02-21 00:02:54,296 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (1 of 5 remaining) [2022-02-21 00:02:54,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2022-02-21 00:02:54,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:54,299 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1] [2022-02-21 00:02:54,303 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:54,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:54 BoogieIcfgContainer [2022-02-21 00:02:54,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:54,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:54,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:54,367 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:54,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:47" (3/4) ... [2022-02-21 00:02:54,369 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:02:54,431 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:02:54,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:54,433 INFO L158 Benchmark]: Toolchain (without parser) took 7481.17ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 64.4MB in the beginning and 121.9MB in the end (delta: -57.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,433 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:54,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.61ms. Allocated memory is still 104.9MB. Free memory was 64.2MB in the beginning and 80.5MB in the end (delta: -16.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.76ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 78.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,434 INFO L158 Benchmark]: Boogie Preprocessor took 18.16ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 77.9MB in the end (delta: 897.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,434 INFO L158 Benchmark]: RCFGBuilder took 278.03ms. Allocated memory is still 104.9MB. Free memory was 77.5MB in the beginning and 66.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,434 INFO L158 Benchmark]: TraceAbstraction took 6766.61ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 65.8MB in the beginning and 126.1MB in the end (delta: -60.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,435 INFO L158 Benchmark]: Witness Printer took 64.85ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 121.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 00:02:54,437 INFO L339 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.17ms. Allocated memory is still 104.9MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.61ms. Allocated memory is still 104.9MB. Free memory was 64.2MB in the beginning and 80.5MB in the end (delta: -16.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.76ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 78.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.16ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 77.9MB in the end (delta: 897.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.03ms. Allocated memory is still 104.9MB. Free memory was 77.5MB in the beginning and 66.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6766.61ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 65.8MB in the beginning and 126.1MB in the end (delta: -60.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 64.85ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 121.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=0] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=0] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=0] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=1] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=1] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=1] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=2] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=2] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=2] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=3] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=3] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=3] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=4] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=4] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=4] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=5] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=5] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=5] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=6] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=6] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=6] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=7] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=7] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=7] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=8] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=8] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=8] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=9] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=9] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=9] [L10] ++i VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=10] [L10] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(int))={11:0}, array={11:0}, i=10] [L14] return array; [L19] RET, EXPR getNumbers() [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={11:0}] [L21] COND TRUE i < 10 [L22] numbers + i - UnprovableResult [Line: 11]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 101 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, InterpolantAutomatonStates: 54, 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, 8 MinimizatonAttempts, 80 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 248 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 2076 SizeOfPredicates, 6 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 287/567 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 00:02:54,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)