./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:18,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:18,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:18,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:18,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:18,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:18,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:18,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:18,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:18,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:18,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:18,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:18,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:18,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:18,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:18,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:18,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:18,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:18,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:18,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:18,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:18,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:18,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:18,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:18,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:18,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:18,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:18,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:18,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:18,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:18,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:18,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:18,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:18,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:18,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:18,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:18,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:18,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:18,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:18,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:18,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:18,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-02-20 23:43:18,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:18,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:18,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:18,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:18,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:18,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:18,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:18,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:18,304 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:18,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:18,305 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:18,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:18,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:18,305 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:18,305 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:18,306 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:18,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:18,306 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:18,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:18,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:18,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:18,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:18,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:18,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:18,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:18,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:18,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:18,307 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2022-02-20 23:43:18,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:18,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:18,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:18,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:18,512 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:18,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2022-02-20 23:43:18,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3024fb2e/da4e50cb735e4172bc5c78f7a4d30830/FLAG344aa377d [2022-02-20 23:43:18,879 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:18,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2022-02-20 23:43:18,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3024fb2e/da4e50cb735e4172bc5c78f7a4d30830/FLAG344aa377d [2022-02-20 23:43:19,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3024fb2e/da4e50cb735e4172bc5c78f7a4d30830 [2022-02-20 23:43:19,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:19,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:19,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:19,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:19,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:19,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3d158b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19, skipping insertion in model container [2022-02-20 23:43:19,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:19,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:19,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:19,523 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:19,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:19,558 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:19,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19 WrapperNode [2022-02-20 23:43:19,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:19,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:19,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:19,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:19,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,597 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-20 23:43:19,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:19,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:19,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:19,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:19,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:19,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:19,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:19,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:19,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (1/1) ... [2022-02-20 23:43:19,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:19,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:19,677 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-20 23:43:19,718 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-20 23:43:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:43:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:19,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:43:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:43:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:19,777 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:19,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:19,968 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:19,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:19,982 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:43:19,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:19 BoogieIcfgContainer [2022-02-20 23:43:19,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:19,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:19,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:19,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:19,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:19" (1/3) ... [2022-02-20 23:43:19,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7d5c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:19, skipping insertion in model container [2022-02-20 23:43:19,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:19" (2/3) ... [2022-02-20 23:43:19,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7d5c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:19, skipping insertion in model container [2022-02-20 23:43:19,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:19" (3/3) ... [2022-02-20 23:43:20,001 INFO L111 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2022-02-20 23:43:20,008 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:20,008 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 23:43:20,039 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:20,043 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-20 23:43:20,044 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 23:43:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 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-20 23:43:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:20,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:20,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:20,066 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-20 23:43:20,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:20,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820914802] [2022-02-20 23:43:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:20,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:20,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#true} is VALID [2022-02-20 23:43:20,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {28#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:43:20,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {28#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} is VALID [2022-02-20 23:43:20,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#(= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1)} assume !(1 == #valid[main_~#a~0#1.base]); {27#false} is VALID [2022-02-20 23:43:20,249 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-20 23:43:20,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:20,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820914802] [2022-02-20 23:43:20,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820914802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:20,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:20,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:20,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237227362] [2022-02-20 23:43:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:20,256 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-20 23:43:20,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:20,259 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-20 23:43:20,266 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-20 23:43:20,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:20,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:20,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:20,283 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 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-20 23:43:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:20,336 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 23:43:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:20,336 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-20 23:43:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:20,337 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-20 23:43:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:43:20,340 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-20 23:43:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:43:20,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 23:43:20,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:20,369 INFO L225 Difference]: With dead ends: 20 [2022-02-20 23:43:20,369 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:43:20,371 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-20 23:43:20,373 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:20,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:43:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:43:20,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:20,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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-20 23:43:20,391 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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-20 23:43:20,392 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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-20 23:43:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:20,393 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 23:43:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 23:43:20,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:20,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:20,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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 18 states. [2022-02-20 23:43:20,395 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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 18 states. [2022-02-20 23:43:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:20,396 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 23:43:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 23:43:20,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:20,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:20,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:20,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 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-20 23:43:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 23:43:20,399 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 4 [2022-02-20 23:43:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:20,399 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 23:43:20,400 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-20 23:43:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 23:43:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:20,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:20,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:20,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:20,401 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-20 23:43:20,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:20,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749869019] [2022-02-20 23:43:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:20,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {105#true} is VALID [2022-02-20 23:43:20,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {107#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {107#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~n~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~n~0#1); {106#false} is VALID [2022-02-20 23:43:20,446 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-20 23:43:20,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:20,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749869019] [2022-02-20 23:43:20,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749869019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:20,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:20,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:20,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957890051] [2022-02-20 23:43:20,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:20,448 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-20 23:43:20,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:20,449 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-20 23:43:20,453 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-20 23:43:20,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:20,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:20,454 INFO L87 Difference]: Start difference. First operand 18 states and 20 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-20 23:43:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:20,487 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 23:43:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:20,488 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-20 23:43:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:20,488 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-20 23:43:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 23:43:20,489 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-20 23:43:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 23:43:20,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-20 23:43:20,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:20,511 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:43:20,512 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:43:20,512 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-20 23:43:20,518 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:20,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:43:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-02-20 23:43:20,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:20,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-20 23:43:20,525 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-20 23:43:20,525 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-20 23:43:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:20,527 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 23:43:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 23:43:20,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:20,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:20,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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 22 states. [2022-02-20 23:43:20,529 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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 22 states. [2022-02-20 23:43:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:20,534 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 23:43:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 23:43:20,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:20,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:20,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:20,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-20 23:43:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-02-20 23:43:20,537 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2022-02-20 23:43:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:20,537 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-20 23:43:20,537 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-20 23:43:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 23:43:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:20,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:20,538 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:20,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:20,539 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 264435913, now seen corresponding path program 1 times [2022-02-20 23:43:20,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:20,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112508110] [2022-02-20 23:43:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:20,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {196#true} is VALID [2022-02-20 23:43:20,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:20,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:20,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:20,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet2#1; {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:20,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {199#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:20,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {200#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| 9))} is VALID [2022-02-20 23:43:20,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| 9))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~n~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~n~0#1); {197#false} is VALID [2022-02-20 23:43:20,653 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-20 23:43:20,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:20,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112508110] [2022-02-20 23:43:20,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112508110] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:20,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701118003] [2022-02-20 23:43:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:20,656 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-20 23:43:20,657 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-20 23:43:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:20,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:43:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:20,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:20,795 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-20 23:43:20,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {196#true} is VALID [2022-02-20 23:43:20,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~nondet2#1; {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {207#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {220#(and (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(and (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {220#(and (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 23:43:20,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(and (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 1) (<= 40 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~n~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~n~0#1); {197#false} is VALID [2022-02-20 23:43:20,874 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-20 23:43:20,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:20,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~n~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~n~0#1); {197#false} is VALID [2022-02-20 23:43:20,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {227#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))))} is VALID [2022-02-20 23:43:20,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {227#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4))))} is VALID [2022-02-20 23:43:20,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} havoc main_#t~nondet2#1; {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} is VALID [2022-02-20 23:43:20,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} is VALID [2022-02-20 23:43:20,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} is VALID [2022-02-20 23:43:20,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {234#(and (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~n~0#1| 4) 4)))} is VALID [2022-02-20 23:43:20,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {196#true} is VALID [2022-02-20 23:43:20,974 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-20 23:43:20,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701118003] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:20,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:20,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-02-20 23:43:20,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064206528] [2022-02-20 23:43:20,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 8 [2022-02-20 23:43:20,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:20,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-20 23:43:20,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:20,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:43:20,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:43:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:43:20,999 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-20 23:43:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,157 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:43:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:43:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 8 [2022-02-20 23:43:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-20 23:43:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 23:43:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-20 23:43:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 23:43:21,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-02-20 23:43:21,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:21,194 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:43:21,194 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:43:21,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:43:21,195 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:21,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:43:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:43:21,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:21,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,198 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,198 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,199 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:43:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:43:21,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:21,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:21,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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 30 states. [2022-02-20 23:43:21,200 INFO L87 Difference]: Start difference. First operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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 30 states. [2022-02-20 23:43:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,201 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:43:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:43:21,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:21,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:21,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:21,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-20 23:43:21,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2022-02-20 23:43:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:21,203 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-20 23:43:21,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-20 23:43:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:43:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:43:21,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:21,204 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:21,221 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-20 23:43:21,421 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-20 23:43:21,421 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1080369951, now seen corresponding path program 1 times [2022-02-20 23:43:21,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:21,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504231389] [2022-02-20 23:43:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:21,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {373#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {373#true} is VALID [2022-02-20 23:43:21,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {373#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet2#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet2#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet2#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~nondet2#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~n~0#1 < 10); {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 23:43:21,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {375#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; {376#(and (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (not |ULTIMATE.start_main_#t~short4#1|) (and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 9))))} is VALID [2022-02-20 23:43:21,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {376#(and (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (not |ULTIMATE.start_main_#t~short4#1|) (and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 9))))} assume main_#t~short4#1; {377#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 23:43:21,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {377#(and (= (+ (- 40) (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume !(4 + (main_~#a~0#1.offset + 4 * main_~i~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~i~0#1); {374#false} is VALID [2022-02-20 23:43:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 23:43:21,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:21,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504231389] [2022-02-20 23:43:21,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504231389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:21,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:21,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:21,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60494626] [2022-02-20 23:43:21,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:21,531 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 22 [2022-02-20 23:43:21,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:21,532 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-20 23:43:21,539 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-20 23:43:21,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:21,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:21,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:21,541 INFO L87 Difference]: Start difference. First operand 30 states and 32 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-20 23:43:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,610 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 23:43:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:21,610 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 22 [2022-02-20 23:43:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:21,611 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-20 23:43:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:43:21,612 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-20 23:43:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:43:21,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-20 23:43:21,633 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-20 23:43:21,633 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:43:21,633 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:43:21,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:21,634 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:21,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:43:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-20 23:43:21,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:21,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 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-20 23:43:21,637 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 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-20 23:43:21,637 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 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-20 23:43:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,638 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 23:43:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 23:43:21,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:21,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:21,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 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 33 states. [2022-02-20 23:43:21,639 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 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 33 states. [2022-02-20 23:43:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,640 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 23:43:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 23:43:21,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:21,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:21,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:21,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 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-20 23:43:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 23:43:21,642 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2022-02-20 23:43:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:21,642 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 23:43:21,643 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-20 23:43:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 23:43:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:43:21,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:21,643 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:21,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:21,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash 868275973, now seen corresponding path program 1 times [2022-02-20 23:43:21,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:21,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750950598] [2022-02-20 23:43:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:21,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {510#true} is VALID [2022-02-20 23:43:21,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {510#true} is VALID [2022-02-20 23:43:21,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {510#true} is VALID [2022-02-20 23:43:21,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#true} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {510#true} is VALID [2022-02-20 23:43:21,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {510#true} havoc main_#t~nondet2#1; {510#true} is VALID [2022-02-20 23:43:21,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {510#true} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {510#true} is VALID [2022-02-20 23:43:21,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#true} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#true} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#true} havoc main_#t~nondet2#1; {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#true} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#true} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#true} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {510#true} havoc main_#t~nondet2#1; {510#true} is VALID [2022-02-20 23:43:21,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {510#true} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {510#true} is VALID [2022-02-20 23:43:21,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {510#true} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {510#true} is VALID [2022-02-20 23:43:21,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {510#true} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {510#true} is VALID [2022-02-20 23:43:21,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#true} havoc main_#t~nondet2#1; {510#true} is VALID [2022-02-20 23:43:21,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {510#true} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {510#true} is VALID [2022-02-20 23:43:21,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {510#true} assume !(main_~n~0#1 < 10); {510#true} is VALID [2022-02-20 23:43:21,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {510#true} main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; {510#true} is VALID [2022-02-20 23:43:21,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#true} assume !main_#t~short4#1; {512#(not |ULTIMATE.start_main_#t~short4#1|)} is VALID [2022-02-20 23:43:21,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#(not |ULTIMATE.start_main_#t~short4#1|)} assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {511#false} is VALID [2022-02-20 23:43:21,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#false} assume !(4 + (main_~#a~0#1.offset + 4 * main_~i~0#1) <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset + 4 * main_~i~0#1); {511#false} is VALID [2022-02-20 23:43:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 23:43:21,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:21,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750950598] [2022-02-20 23:43:21,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750950598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:21,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:21,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:21,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953301048] [2022-02-20 23:43:21,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 23 [2022-02-20 23:43:21,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:21,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 23:43:21,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:21,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:21,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:21,695 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 23:43:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,711 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:43:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 23 [2022-02-20 23:43:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 23:43:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-20 23:43:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 23:43:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-20 23:43:21,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2022-02-20 23:43:21,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:21,725 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:43:21,725 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:43:21,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 23:43:21,726 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:21,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:43:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:43:21,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:21,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,728 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,729 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,730 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:43:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:43:21,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:21,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:21,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 30 states. [2022-02-20 23:43:21,730 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 30 states. [2022-02-20 23:43:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:21,731 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:43:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:43:21,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:21,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:21,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:21,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-20 23:43:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-20 23:43:21,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-02-20 23:43:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:21,733 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-20 23:43:21,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 23:43:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:43:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:43:21,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:21,734 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:21,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:43:21,734 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1146749636, now seen corresponding path program 1 times [2022-02-20 23:43:21,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:21,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902252807] [2022-02-20 23:43:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:21,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {635#true} is VALID [2022-02-20 23:43:21,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {637#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {637#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {637#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {637#(= |ULTIMATE.start_main_~n~0#1| 0)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {637#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {637#(= |ULTIMATE.start_main_~n~0#1| 0)} havoc main_#t~nondet2#1; {637#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {637#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} havoc main_#t~nondet2#1; {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} havoc main_#t~nondet2#1; {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} havoc main_#t~nondet2#1; {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {641#(<= |ULTIMATE.start_main_~n~0#1| 4)} is VALID [2022-02-20 23:43:21,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {641#(<= |ULTIMATE.start_main_~n~0#1| 4)} assume !(main_~n~0#1 < 10); {636#false} is VALID [2022-02-20 23:43:21,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#false} main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; {636#false} is VALID [2022-02-20 23:43:21,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#false} assume !main_#t~short4#1; {636#false} is VALID [2022-02-20 23:43:21,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {636#false} assume !main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1; {636#false} is VALID [2022-02-20 23:43:21,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {636#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {636#false} is VALID [2022-02-20 23:43:21,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#false} assume !(#valid == main_old_#valid#1); {636#false} is VALID [2022-02-20 23:43:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:21,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:21,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902252807] [2022-02-20 23:43:21,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902252807] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:21,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930584997] [2022-02-20 23:43:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:21,802 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-20 23:43:21,819 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-20 23:43:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:21,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:43:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:21,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:21,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {635#true} is VALID [2022-02-20 23:43:21,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} havoc main_#t~nondet2#1; {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:21,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {648#(<= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} havoc main_#t~nondet2#1; {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 23:43:21,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} havoc main_#t~nondet2#1; {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-20 23:43:21,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {639#(<= |ULTIMATE.start_main_~n~0#1| 2)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} havoc main_#t~nondet2#1; {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 23:43:21,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {640#(<= |ULTIMATE.start_main_~n~0#1| 3)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {641#(<= |ULTIMATE.start_main_~n~0#1| 4)} is VALID [2022-02-20 23:43:21,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {641#(<= |ULTIMATE.start_main_~n~0#1| 4)} assume !(main_~n~0#1 < 10); {636#false} is VALID [2022-02-20 23:43:21,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#false} main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; {636#false} is VALID [2022-02-20 23:43:21,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#false} assume !main_#t~short4#1; {636#false} is VALID [2022-02-20 23:43:21,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {636#false} assume !main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1; {636#false} is VALID [2022-02-20 23:43:21,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {636#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {636#false} is VALID [2022-02-20 23:43:21,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#false} assume !(#valid == main_old_#valid#1); {636#false} is VALID [2022-02-20 23:43:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:21,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:22,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#false} assume !(#valid == main_old_#valid#1); {636#false} is VALID [2022-02-20 23:43:22,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {636#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {636#false} is VALID [2022-02-20 23:43:22,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {636#false} assume !main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1; {636#false} is VALID [2022-02-20 23:43:22,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#false} assume !main_#t~short4#1; {636#false} is VALID [2022-02-20 23:43:22,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#false} main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; {636#false} is VALID [2022-02-20 23:43:22,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {730#(< |ULTIMATE.start_main_~n~0#1| 10)} assume !(main_~n~0#1 < 10); {636#false} is VALID [2022-02-20 23:43:22,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#(< |ULTIMATE.start_main_~n~0#1| 9)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {730#(< |ULTIMATE.start_main_~n~0#1| 10)} is VALID [2022-02-20 23:43:22,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(< |ULTIMATE.start_main_~n~0#1| 9)} havoc main_#t~nondet2#1; {734#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-20 23:43:22,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#(< |ULTIMATE.start_main_~n~0#1| 9)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {734#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-20 23:43:22,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {734#(< |ULTIMATE.start_main_~n~0#1| 9)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {734#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-20 23:43:22,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {747#(< |ULTIMATE.start_main_~n~0#1| 8)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {734#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-20 23:43:22,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {747#(< |ULTIMATE.start_main_~n~0#1| 8)} havoc main_#t~nondet2#1; {747#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-20 23:43:22,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {747#(< |ULTIMATE.start_main_~n~0#1| 8)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {747#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-20 23:43:22,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(< |ULTIMATE.start_main_~n~0#1| 8)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {747#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-20 23:43:22,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#(< |ULTIMATE.start_main_~n~0#1| 7)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {747#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-20 23:43:22,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#(< |ULTIMATE.start_main_~n~0#1| 7)} havoc main_#t~nondet2#1; {760#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 23:43:22,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#(< |ULTIMATE.start_main_~n~0#1| 7)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {760#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 23:43:22,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#(< |ULTIMATE.start_main_~n~0#1| 7)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {760#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 23:43:22,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#(< |ULTIMATE.start_main_~n~0#1| 6)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {760#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 23:43:22,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {773#(< |ULTIMATE.start_main_~n~0#1| 6)} havoc main_#t~nondet2#1; {773#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-20 23:43:22,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {773#(< |ULTIMATE.start_main_~n~0#1| 6)} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {773#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-20 23:43:22,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#(< |ULTIMATE.start_main_~n~0#1| 6)} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {773#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-20 23:43:22,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {773#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-20 23:43:22,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {635#true} is VALID [2022-02-20 23:43:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:22,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930584997] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:22,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:22,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 23:43:22,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488963979] [2022-02-20 23:43:22,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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 24 [2022-02-20 23:43:22,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:22,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-20 23:43:22,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:22,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:43:22,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:43:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:43:22,125 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-20 23:43:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:22,206 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-20 23:43:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:43:22,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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 24 [2022-02-20 23:43:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-20 23:43:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-20 23:43:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-20 23:43:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-20 23:43:22,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-02-20 23:43:22,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:22,250 INFO L225 Difference]: With dead ends: 54 [2022-02-20 23:43:22,250 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 23:43:22,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:43:22,251 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:22,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 23:43:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 23:43:22,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:22,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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-20 23:43:22,254 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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-20 23:43:22,254 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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-20 23:43:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:22,255 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-20 23:43:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-20 23:43:22,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:22,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:22,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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 54 states. [2022-02-20 23:43:22,256 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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 54 states. [2022-02-20 23:43:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:22,257 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-20 23:43:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-20 23:43:22,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:22,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:22,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:22,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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-20 23:43:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-02-20 23:43:22,259 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 24 [2022-02-20 23:43:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:22,260 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-02-20 23:43:22,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-20 23:43:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-20 23:43:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 23:43:22,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:22,261 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:22,277 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-20 23:43:22,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:43:22,471 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1408662102, now seen corresponding path program 2 times [2022-02-20 23:43:22,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:22,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507382368] [2022-02-20 23:43:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:22,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1004#true} is VALID [2022-02-20 23:43:22,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {1004#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !!(main_~n~0#1 < 10);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} SUMMARY for call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4); srcloc: L14 {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} havoc main_#t~nondet2#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !(main_~n~0#1 < 10); {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !main_#t~short4#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} assume !main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1; {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} is VALID [2022-02-20 23:43:22,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {1006#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#a~0#1.base| 0))} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; {1007#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:43:22,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {1007#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {1005#false} is VALID [2022-02-20 23:43:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-20 23:43:22,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:22,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507382368] [2022-02-20 23:43:22,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507382368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:22,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:22,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:22,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139174627] [2022-02-20 23:43:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 48 [2022-02-20 23:43:22,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:22,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 23:43:22,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:22,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:22,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:22,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:22,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:22,725 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 23:43:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:22,750 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-02-20 23:43:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 48 [2022-02-20 23:43:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 23:43:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 23:43:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 23:43:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 23:43:22,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-02-20 23:43:22,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:22,763 INFO L225 Difference]: With dead ends: 53 [2022-02-20 23:43:22,763 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 23:43:22,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:22,764 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:22,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 23:43:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 23:43:22,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:22,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-20 23:43:22,766 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-20 23:43:22,766 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-20 23:43:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:22,767 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-02-20 23:43:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-02-20 23:43:22,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:22,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:22,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-20 23:43:22,768 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-20 23:43:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:22,769 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-02-20 23:43:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-02-20 23:43:22,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:22,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:22,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:22,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-20 23:43:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-02-20 23:43:22,770 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2022-02-20 23:43:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:22,770 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-02-20 23:43:22,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 23:43:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-02-20 23:43:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 23:43:22,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:22,771 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:22,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:43:22,771 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:43:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash 713028304, now seen corresponding path program 1 times [2022-02-20 23:43:22,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:22,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287663908] [2022-02-20 23:43:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:43:22,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:43:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:43:22,898 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:43:22,898 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:43:22,899 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (6 of 7 remaining) [2022-02-20 23:43:22,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (5 of 7 remaining) [2022-02-20 23:43:22,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (4 of 7 remaining) [2022-02-20 23:43:22,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (3 of 7 remaining) [2022-02-20 23:43:22,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (2 of 7 remaining) [2022-02-20 23:43:22,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (1 of 7 remaining) [2022-02-20 23:43:22,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2022-02-20 23:43:22,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:43:22,903 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:22,905 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:43:22,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:43:22 BoogieIcfgContainer [2022-02-20 23:43:22,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:43:22,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:43:22,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:43:22,939 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:43:22,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:19" (3/4) ... [2022-02-20 23:43:22,941 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:43:22,993 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:43:22,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:43:22,994 INFO L158 Benchmark]: Toolchain (without parser) took 3660.76ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 61.4MB in the beginning and 120.5MB in the end (delta: -59.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:22,995 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 50.2MB in the beginning and 50.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:22,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.05ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 70.3MB in the end (delta: -9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:43:22,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.11ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:22,995 INFO L158 Benchmark]: Boogie Preprocessor took 34.17ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:22,996 INFO L158 Benchmark]: RCFGBuilder took 350.98ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 55.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:43:22,996 INFO L158 Benchmark]: TraceAbstraction took 2952.18ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 55.1MB in the beginning and 124.7MB in the end (delta: -69.6MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2022-02-20 23:43:22,996 INFO L158 Benchmark]: Witness Printer took 54.94ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 120.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:22,997 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.20ms. Allocated memory is still 94.4MB. Free memory was 50.2MB in the beginning and 50.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.05ms. Allocated memory is still 94.4MB. Free memory was 61.2MB in the beginning and 70.3MB in the end (delta: -9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.11ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.17ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.98ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 55.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2952.18ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 55.1MB in the beginning and 124.7MB in the end (delta: -69.6MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * Witness Printer took 54.94ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 120.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: 20]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, a={2:0}, i=0, n=0] [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, a={2:0}, i=0, n=1] [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, a={2:0}, i=0, n=2] [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={2:0}, i=0, n=3] [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, a={2:0}, i=0, n=4] [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=5, a={2:0}, i=0, n=5] [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, a={2:0}, i=0, n=6] [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=6, a={2:0}, i=0, n=7] [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, a={2:0}, i=0, n=8] [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=7, a={2:0}, i=0, n=9] [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, i=0, n=10] [L17] EXPR a[i] VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=9, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=9, i=0, n=10] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - UnprovableResult [Line: 14]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: 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, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 100 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=6, InterpolantAutomatonStates: 37, 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, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 246/336 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-20 23:43:23,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)