./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy2_ground-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_copy2_ground-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 001066cca5a67e3c9af1d254dd4dcabba7e6cff5ea24a6e35ddcc570894db37c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:02:33,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:02:33,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:02:33,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:02:33,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:02:33,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:02:33,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:02:33,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:02:33,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:02:33,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:02:33,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:02:33,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:02:33,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:02:33,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:02:33,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:02:33,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:02:33,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:02:33,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:02:33,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:02:33,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:02:33,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:02:33,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:02:33,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:02:33,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:02:33,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:02:33,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:02:33,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:02:33,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:02:33,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:02:33,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:02:33,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:02:33,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:02:33,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:02:33,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:02:33,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:02:33,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:02:33,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:02:33,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:02:33,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:02:33,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:02:33,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:02:33,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:02:33,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:02:33,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:02:33,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:02:33,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:02:33,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:02:33,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:02:33,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:02:33,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:02:33,550 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:02:33,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:02:33,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:02:33,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:02:33,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:02:33,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:02:33,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:02:33,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:02:33,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:02:33,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:02:33,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:02:33,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:02:33,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:02:33,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:02:33,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:02:33,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:02:33,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:33,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:02:33,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:02:33,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:02:33,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:02:33,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:02:33,555 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:02:33,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:02:33,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:02:33,556 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 001066cca5a67e3c9af1d254dd4dcabba7e6cff5ea24a6e35ddcc570894db37c [2022-02-20 14:02:33,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:02:33,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:02:33,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:02:33,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:02:33,839 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:02:33,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy2_ground-1.i [2022-02-20 14:02:33,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f96c256/f4a93e5e08ba47d0ab64e0ee6a420a0c/FLAGa1528e8c9 [2022-02-20 14:02:34,320 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:02:34,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy2_ground-1.i [2022-02-20 14:02:34,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f96c256/f4a93e5e08ba47d0ab64e0ee6a420a0c/FLAGa1528e8c9 [2022-02-20 14:02:34,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f96c256/f4a93e5e08ba47d0ab64e0ee6a420a0c [2022-02-20 14:02:34,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:02:34,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:02:34,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:34,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:02:34,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:02:34,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:34" (1/1) ... [2022-02-20 14:02:34,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424bc067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:34, skipping insertion in model container [2022-02-20 14:02:34,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:02:34" (1/1) ... [2022-02-20 14:02:34,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:02:35,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:02:35,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy2_ground-1.i[816,829] [2022-02-20 14:02:35,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:35,414 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:02:35,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy2_ground-1.i[816,829] [2022-02-20 14:02:35,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:02:35,466 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:02:35,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35 WrapperNode [2022-02-20 14:02:35,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:02:35,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:35,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:02:35,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:02:35,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,630 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2022-02-20 14:02:35,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:02:35,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:02:35,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:02:35,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:02:35,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:02:35,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:02:35,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:02:35,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:02:35,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (1/1) ... [2022-02-20 14:02:35,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:02:36,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:36,397 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 14:02:36,400 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 14:02:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:02:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:02:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:02:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:02:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:02:36,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:02:36,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:02:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:02:36,996 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:02:36,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:02:37,196 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:02:37,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:02:37,215 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:02:37,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:37 BoogieIcfgContainer [2022-02-20 14:02:37,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:02:37,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:02:37,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:02:37,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:02:37,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:02:34" (1/3) ... [2022-02-20 14:02:37,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234428ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:37, skipping insertion in model container [2022-02-20 14:02:37,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:02:35" (2/3) ... [2022-02-20 14:02:37,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234428ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:02:37, skipping insertion in model container [2022-02-20 14:02:37,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:02:37" (3/3) ... [2022-02-20 14:02:37,725 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy2_ground-1.i [2022-02-20 14:02:37,750 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:02:37,751 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:02:37,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:02:37,876 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 14:02:37,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:02:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 14:02:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:02:37,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:37,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:37,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -779788197, now seen corresponding path program 1 times [2022-02-20 14:02:37,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:37,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937280379] [2022-02-20 14:02:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-02-20 14:02:38,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {26#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:38,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {25#false} is VALID [2022-02-20 14:02:38,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} havoc main_~i~0#1;main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:02:38,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(main_~i~0#1 < 100000); {25#false} is VALID [2022-02-20 14:02:38,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} main_~i~0#1 := 0; {25#false} is VALID [2022-02-20 14:02:38,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} assume !(main_~i~0#1 < 100000); {25#false} is VALID [2022-02-20 14:02:38,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} havoc main_~x~0#1;main_~x~0#1 := 0; {25#false} is VALID [2022-02-20 14:02:38,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25#false} is VALID [2022-02-20 14:02:38,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond#1; {25#false} is VALID [2022-02-20 14:02:38,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 14:02:38,146 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 14:02:38,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:38,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937280379] [2022-02-20 14:02:38,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937280379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:38,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:02:38,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:02:38,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473252789] [2022-02-20 14:02:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:38,156 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 11 [2022-02-20 14:02:38,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:38,159 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 14:02:38,183 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 14:02:38,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:38,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:38,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:38,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:02:38,209 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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, 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 14:02:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,280 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-02-20 14:02:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:38,281 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 11 [2022-02-20 14:02:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:38,282 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 14:02:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 14:02:38,290 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 14:02:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 14:02:38,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-02-20 14:02:38,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:38,381 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:02:38,381 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:02:38,384 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 14:02:38,387 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:38,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:02:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-20 14:02:38,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:38,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 14:02:38,411 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 14:02:38,412 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 14:02:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,415 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 14:02:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 14:02:38,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 19 states. [2022-02-20 14:02:38,416 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 19 states. [2022-02-20 14:02:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,418 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 14:02:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 14:02:38,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:38,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 14:02:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 14:02:38,422 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-02-20 14:02:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:38,423 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 14:02:38,423 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 14:02:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 14:02:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:02:38,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:38,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:38,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:02:38,425 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 383923737, now seen corresponding path program 1 times [2022-02-20 14:02:38,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:38,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755124718] [2022-02-20 14:02:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {140#true} is VALID [2022-02-20 14:02:38,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {142#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:38,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {142#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:38,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {143#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:38,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {143#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {141#false} is VALID [2022-02-20 14:02:38,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#false} havoc main_~i~0#1;main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:02:38,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#false} assume !(main_~i~0#1 < 100000); {141#false} is VALID [2022-02-20 14:02:38,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:02:38,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#false} assume !(main_~i~0#1 < 100000); {141#false} is VALID [2022-02-20 14:02:38,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#false} havoc main_~x~0#1;main_~x~0#1 := 0; {141#false} is VALID [2022-02-20 14:02:38,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {141#false} is VALID [2022-02-20 14:02:38,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume 0 == __VERIFIER_assert_~cond#1; {141#false} is VALID [2022-02-20 14:02:38,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 14:02:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:02:38,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:38,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755124718] [2022-02-20 14:02:38,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755124718] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:38,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915777146] [2022-02-20 14:02:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:38,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:38,504 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 14:02:38,505 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 14:02:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:02:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:38,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:38,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {140#true} is VALID [2022-02-20 14:02:38,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {140#true} is VALID [2022-02-20 14:02:38,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {140#true} is VALID [2022-02-20 14:02:38,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {140#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {140#true} is VALID [2022-02-20 14:02:38,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#true} assume !(main_~a~0#1 < 100000); {140#true} is VALID [2022-02-20 14:02:38,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} havoc main_~i~0#1;main_~i~0#1 := 0; {162#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:38,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {141#false} is VALID [2022-02-20 14:02:38,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:02:38,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#false} assume !(main_~i~0#1 < 100000); {141#false} is VALID [2022-02-20 14:02:38,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#false} havoc main_~x~0#1;main_~x~0#1 := 0; {141#false} is VALID [2022-02-20 14:02:38,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {141#false} is VALID [2022-02-20 14:02:38,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume 0 == __VERIFIER_assert_~cond#1; {141#false} is VALID [2022-02-20 14:02:38,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 14:02:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:02:38,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:02:38,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915777146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:02:38,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:02:38,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:02:38,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814908481] [2022-02-20 14:02:38,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:02:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:02:38,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:38,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:02:38,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:38,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:02:38,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:02:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:38,658 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:02:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,718 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 14:02:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:02:38,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:02:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:02:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 14:02:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:02:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 14:02:38,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-02-20 14:02:38,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:38,755 INFO L225 Difference]: With dead ends: 32 [2022-02-20 14:02:38,755 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:02:38,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:02:38,758 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 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 14:02:38,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:02:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-02-20 14:02:38,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:38,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,766 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,766 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,768 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:02:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:02:38,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 14:02:38,769 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 14:02:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:38,770 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 14:02:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 14:02:38,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:38,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:38,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:38,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:02:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 14:02:38,771 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-02-20 14:02:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:38,771 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 14:02:38,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14:02:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 14:02:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:02:38,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:38,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:38,798 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 14:02:38,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:38,991 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1602849365, now seen corresponding path program 1 times [2022-02-20 14:02:38,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:38,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034686886] [2022-02-20 14:02:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:39,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {295#true} is VALID [2022-02-20 14:02:39,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {297#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {297#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {297#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {298#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:39,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#false} havoc main_~i~0#1;main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {296#false} is VALID [2022-02-20 14:02:39,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {296#false} is VALID [2022-02-20 14:02:39,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {296#false} is VALID [2022-02-20 14:02:39,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {296#false} is VALID [2022-02-20 14:02:39,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} havoc main_~x~0#1;main_~x~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {296#false} is VALID [2022-02-20 14:02:39,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 14:02:39,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 14:02:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:02:39,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:39,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034686886] [2022-02-20 14:02:39,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034686886] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:39,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584494161] [2022-02-20 14:02:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:39,100 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 14:02:39,112 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 14:02:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:39,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:02:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:39,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:39,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {295#true} is VALID [2022-02-20 14:02:39,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {305#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {305#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:39,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {305#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {298#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:39,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#false} havoc main_~i~0#1;main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {296#false} is VALID [2022-02-20 14:02:39,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {296#false} is VALID [2022-02-20 14:02:39,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {296#false} is VALID [2022-02-20 14:02:39,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {296#false} is VALID [2022-02-20 14:02:39,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} havoc main_~x~0#1;main_~x~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {296#false} is VALID [2022-02-20 14:02:39,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 14:02:39,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 14:02:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:02:39,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:39,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-02-20 14:02:39,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} assume 0 == __VERIFIER_assert_~cond#1; {296#false} is VALID [2022-02-20 14:02:39,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {296#false} is VALID [2022-02-20 14:02:39,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} havoc main_~x~0#1;main_~x~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#false} main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#false} assume !(main_~i~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {296#false} is VALID [2022-02-20 14:02:39,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {296#false} is VALID [2022-02-20 14:02:39,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#false} havoc main_~i~0#1;main_~i~0#1 := 0; {296#false} is VALID [2022-02-20 14:02:39,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {387#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {296#false} is VALID [2022-02-20 14:02:39,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {387#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:39,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {391#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {391#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:39,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {391#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:39,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {295#true} is VALID [2022-02-20 14:02:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:02:39,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584494161] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:39,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:39,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:02:39,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929959858] [2022-02-20 14:02:39,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:39,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 17 [2022-02-20 14:02:39,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:39,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 14:02:39,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:39,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:02:39,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:02:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:39,400 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 14:02:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:39,481 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 14:02:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:02:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 17 [2022-02-20 14:02:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 14:02:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 14:02:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 14:02:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 14:02:39,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-02-20 14:02:39,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:39,521 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:02:39,521 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:02:39,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:39,524 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:39,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:02:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 14:02:39,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:39,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 14:02:39,537 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 14:02:39,537 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 14:02:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:39,539 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:02:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:02:39,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:39,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:39,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 26 states. [2022-02-20 14:02:40,325 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 26 states. [2022-02-20 14:02:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:40,328 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 14:02:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:02:40,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:40,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:40,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:40,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 14:02:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-02-20 14:02:40,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2022-02-20 14:02:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:40,329 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-02-20 14:02:40,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 14:02:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 14:02:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:02:40,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:40,330 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:40,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:40,531 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,SelfDestructingSolverStorable2 [2022-02-20 14:02:40,533 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 862458255, now seen corresponding path program 2 times [2022-02-20 14:02:40,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:40,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532607155] [2022-02-20 14:02:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {544#true} is VALID [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {544#true} is VALID [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:40,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:40,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:40,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:40,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:41,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#true} assume !(main_~a~0#1 < 100000); {544#true} is VALID [2022-02-20 14:02:41,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#true} havoc main_~i~0#1;main_~i~0#1 := 0; {546#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:41,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {546#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:41,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {547#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:41,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {547#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {545#false} is VALID [2022-02-20 14:02:41,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#false} main_~i~0#1 := 0; {545#false} is VALID [2022-02-20 14:02:41,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {545#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {545#false} is VALID [2022-02-20 14:02:41,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {545#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {545#false} is VALID [2022-02-20 14:02:41,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {545#false} assume !(main_~i~0#1 < 100000); {545#false} is VALID [2022-02-20 14:02:41,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {545#false} havoc main_~x~0#1;main_~x~0#1 := 0; {545#false} is VALID [2022-02-20 14:02:41,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {545#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {545#false} is VALID [2022-02-20 14:02:41,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {545#false} assume 0 == __VERIFIER_assert_~cond#1; {545#false} is VALID [2022-02-20 14:02:41,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#false} assume !false; {545#false} is VALID [2022-02-20 14:02:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 14:02:41,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:41,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532607155] [2022-02-20 14:02:41,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532607155] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:41,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338186764] [2022-02-20 14:02:41,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:02:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:41,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:02:41,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:02:41,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:02:41,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:41,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:02:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:41,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:41,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {544#true} is VALID [2022-02-20 14:02:41,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {544#true} is VALID [2022-02-20 14:02:41,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:41,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:41,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:41,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:41,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:41,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:41,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:41,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:41,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#true} assume !(main_~a~0#1 < 100000); {544#true} is VALID [2022-02-20 14:02:41,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#true} havoc main_~i~0#1;main_~i~0#1 := 0; {544#true} is VALID [2022-02-20 14:02:41,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {544#true} is VALID [2022-02-20 14:02:41,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {544#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {544#true} is VALID [2022-02-20 14:02:41,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#true} assume !(main_~i~0#1 < 100000); {544#true} is VALID [2022-02-20 14:02:41,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#true} main_~i~0#1 := 0; {596#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:41,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {596#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:02:41,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {547#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:02:41,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {545#false} is VALID [2022-02-20 14:02:41,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {545#false} havoc main_~x~0#1;main_~x~0#1 := 0; {545#false} is VALID [2022-02-20 14:02:41,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {545#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {545#false} is VALID [2022-02-20 14:02:43,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {545#false} assume 0 == __VERIFIER_assert_~cond#1; {545#false} is VALID [2022-02-20 14:02:43,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#false} assume !false; {545#false} is VALID [2022-02-20 14:02:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 14:02:43,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:43,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#false} assume !false; {545#false} is VALID [2022-02-20 14:02:43,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {545#false} assume 0 == __VERIFIER_assert_~cond#1; {545#false} is VALID [2022-02-20 14:02:43,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {545#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {545#false} is VALID [2022-02-20 14:02:43,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {545#false} havoc main_~x~0#1;main_~x~0#1 := 0; {545#false} is VALID [2022-02-20 14:02:43,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {630#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {545#false} is VALID [2022-02-20 14:02:43,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {634#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {630#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:02:43,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {634#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {634#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:43,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#true} main_~i~0#1 := 0; {634#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:02:43,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#true} assume !(main_~i~0#1 < 100000); {544#true} is VALID [2022-02-20 14:02:43,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {544#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {544#true} is VALID [2022-02-20 14:02:43,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {544#true} is VALID [2022-02-20 14:02:43,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#true} havoc main_~i~0#1;main_~i~0#1 := 0; {544#true} is VALID [2022-02-20 14:02:43,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#true} assume !(main_~a~0#1 < 100000); {544#true} is VALID [2022-02-20 14:02:43,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:43,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {544#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {544#true} is VALID [2022-02-20 14:02:43,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {544#true} is VALID [2022-02-20 14:02:43,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {544#true} is VALID [2022-02-20 14:02:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-20 14:02:43,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338186764] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:43,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:43,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:02:43,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74662214] [2022-02-20 14:02:43,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:43,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:43,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:43,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:43,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:02:43,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:02:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:43,958 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:44,197 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-02-20 14:02:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:02:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 14:02:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 14:02:44,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 14:02:44,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:44,240 INFO L225 Difference]: With dead ends: 49 [2022-02-20 14:02:44,240 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:02:44,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:02:44,241 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:44,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:02:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 14:02:44,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:44,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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 14:02:44,264 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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 14:02:44,264 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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 14:02:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:44,265 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 14:02:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 14:02:44,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:44,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:44,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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 38 states. [2022-02-20 14:02:44,266 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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 38 states. [2022-02-20 14:02:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:44,267 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 14:02:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 14:02:44,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:44,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:44,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:44,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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 14:02:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-02-20 14:02:44,268 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2022-02-20 14:02:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:44,268 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-02-20 14:02:44,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 14:02:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 14:02:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:02:44,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:44,269 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:44,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:44,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:44,480 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1441156285, now seen corresponding path program 3 times [2022-02-20 14:02:44,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:44,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109124405] [2022-02-20 14:02:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:44,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {883#true} is VALID [2022-02-20 14:02:44,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {885#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:44,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {885#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:44,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {885#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:44,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:44,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:44,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:44,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:44,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:44,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {889#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:44,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {889#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:44,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#false} havoc main_~i~0#1;main_~i~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#false} assume !(main_~i~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} main_~i~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:44,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {884#false} assume !(main_~i~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {884#false} havoc main_~x~0#1;main_~x~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {884#false} assume 0 == __VERIFIER_assert_~cond#1; {884#false} is VALID [2022-02-20 14:02:44,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 14:02:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:44,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:44,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109124405] [2022-02-20 14:02:44,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109124405] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:44,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836838400] [2022-02-20 14:02:44,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:02:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:44,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:02:44,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:02:44,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:02:44,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:44,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:02:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:44,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:44,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {883#true} is VALID [2022-02-20 14:02:44,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {896#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:44,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {896#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:44,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {896#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:44,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:44,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:44,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:44,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {887#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:44,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:44,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {888#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {889#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:44,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {889#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:44,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#false} havoc main_~i~0#1;main_~i~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:44,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:44,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:44,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#false} assume !(main_~i~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:44,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} main_~i~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:44,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {884#false} assume !(main_~i~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {884#false} havoc main_~x~0#1;main_~x~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {884#false} assume 0 == __VERIFIER_assert_~cond#1; {884#false} is VALID [2022-02-20 14:02:44,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 14:02:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:44,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:45,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {884#false} assume 0 == __VERIFIER_assert_~cond#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {884#false} havoc main_~x~0#1;main_~x~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {884#false} assume !(main_~i~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:45,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} main_~i~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#false} assume !(main_~i~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {884#false} is VALID [2022-02-20 14:02:45,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {884#false} is VALID [2022-02-20 14:02:45,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#false} havoc main_~i~0#1;main_~i~0#1 := 0; {884#false} is VALID [2022-02-20 14:02:45,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {884#false} is VALID [2022-02-20 14:02:45,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1068#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:45,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1072#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:45,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1072#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:45,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1079#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1079#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:45,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {1086#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1079#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:45,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {1086#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1086#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:45,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {1093#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1086#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:45,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1093#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:45,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1093#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:45,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {883#true} is VALID [2022-02-20 14:02:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:45,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836838400] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:45,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:45,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:02:45,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667641347] [2022-02-20 14:02:45,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 35 [2022-02-20 14:02:45,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:45,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 14:02:45,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:45,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:02:45,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:02:45,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:02:45,199 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 14:02:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,303 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-02-20 14:02:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:02:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 35 [2022-02-20 14:02:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 14:02:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-02-20 14:02:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 14:02:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-02-20 14:02:45,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-02-20 14:02:45,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:45,355 INFO L225 Difference]: With dead ends: 77 [2022-02-20 14:02:45,355 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:02:45,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:02:45,357 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:45,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:02:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:02:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 14:02:45,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:45,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 14:02:45,372 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 14:02:45,372 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 14:02:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,374 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-20 14:02:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-02-20 14:02:45,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:45,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:45,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 14:02:45,376 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 14:02:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:45,377 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-20 14:02:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-02-20 14:02:45,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:45,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:45,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:45,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 14:02:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-02-20 14:02:45,381 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 35 [2022-02-20 14:02:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:45,381 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-02-20 14:02:45,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 14:02:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-02-20 14:02:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 14:02:45,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:45,382 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:45,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 14:02:45,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:45,588 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash -100034249, now seen corresponding path program 4 times [2022-02-20 14:02:45,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:45,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553335428] [2022-02-20 14:02:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1384#true} is VALID [2022-02-20 14:02:45,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1386#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:45,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1386#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:45,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {1386#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:45,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:45,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:45,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:45,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:45,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:45,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:45,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:45,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:45,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:45,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:45,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:45,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:45,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:45,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:45,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:45,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:45,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:45,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1396#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {1385#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:45,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#false} assume !(main_~i~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {1385#false} main_~i~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:45,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:45,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:45,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:45,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {1385#false} assume !(main_~i~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:45,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {1385#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:45,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {1385#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1385#false} is VALID [2022-02-20 14:02:45,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {1385#false} assume 0 == __VERIFIER_assert_~cond#1; {1385#false} is VALID [2022-02-20 14:02:45,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2022-02-20 14:02:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:45,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:45,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553335428] [2022-02-20 14:02:45,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553335428] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:45,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114712153] [2022-02-20 14:02:45,827 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:02:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:45,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:02:45,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:02:45,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:02:45,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:02:45,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:02:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:45,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:02:46,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1384#true} is VALID [2022-02-20 14:02:46,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1403#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:46,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1403#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1403#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:46,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {1403#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:46,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:46,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1387#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:46,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:46,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {1388#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:46,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:46,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:46,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:46,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:46,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:46,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {1391#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:46,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:46,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {1392#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:46,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:46,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1393#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:46,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:46,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {1394#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:46,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:46,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {1395#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1396#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {1385#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#false} assume !(main_~i~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {1385#false} main_~i~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {1385#false} assume !(main_~i~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:46,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {1385#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:46,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {1385#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1385#false} is VALID [2022-02-20 14:02:46,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {1385#false} assume 0 == __VERIFIER_assert_~cond#1; {1385#false} is VALID [2022-02-20 14:02:46,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2022-02-20 14:02:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:46,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:02:46,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2022-02-20 14:02:46,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {1385#false} assume 0 == __VERIFIER_assert_~cond#1; {1385#false} is VALID [2022-02-20 14:02:46,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {1385#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1385#false} is VALID [2022-02-20 14:02:46,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {1385#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {1385#false} assume !(main_~i~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 41: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {1385#false} main_~i~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:46,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#false} assume !(main_~i~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1385#false} is VALID [2022-02-20 14:02:46,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {1385#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {1385#false} is VALID [2022-02-20 14:02:46,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {1385#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1385#false} is VALID [2022-02-20 14:02:46,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {1611#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {1385#false} is VALID [2022-02-20 14:02:46,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {1615#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1611#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:02:46,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {1615#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1615#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:46,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1615#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:02:46,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1622#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:46,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {1629#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1622#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:02:46,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1629#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:46,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {1636#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1629#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:02:46,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {1636#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1636#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:46,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {1643#(< |ULTIMATE.start_main_~a~0#1| 99995)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1636#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:02:46,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1643#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1643#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:02:46,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {1650#(< |ULTIMATE.start_main_~a~0#1| 99994)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1643#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:02:46,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {1650#(< |ULTIMATE.start_main_~a~0#1| 99994)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1650#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:02:46,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(< |ULTIMATE.start_main_~a~0#1| 99993)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1650#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:02:46,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(< |ULTIMATE.start_main_~a~0#1| 99993)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1657#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:02:46,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1664#(< |ULTIMATE.start_main_~a~0#1| 99992)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1657#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:02:46,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {1664#(< |ULTIMATE.start_main_~a~0#1| 99992)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1664#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:02:46,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#(< |ULTIMATE.start_main_~a~0#1| 99991)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1664#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:02:46,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {1671#(< |ULTIMATE.start_main_~a~0#1| 99991)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1671#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:02:46,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {1678#(< |ULTIMATE.start_main_~a~0#1| 99990)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1671#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:02:46,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {1678#(< |ULTIMATE.start_main_~a~0#1| 99990)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {1678#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:02:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1678#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:02:46,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1384#true} is VALID [2022-02-20 14:02:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:46,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114712153] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:02:46,661 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:02:46,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:02:46,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438263325] [2022-02-20 14:02:46,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:02:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 47 [2022-02-20 14:02:46,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:02:46,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 14:02:46,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:46,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:02:46,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:02:46,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:02:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:02:46,723 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 14:02:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:46,920 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-02-20 14:02:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:02:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 47 [2022-02-20 14:02:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:02:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 14:02:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 90 transitions. [2022-02-20 14:02:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 14:02:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 90 transitions. [2022-02-20 14:02:46,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 90 transitions. [2022-02-20 14:02:47,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:02:47,005 INFO L225 Difference]: With dead ends: 101 [2022-02-20 14:02:47,005 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 14:02:47,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:02:47,006 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:02:47,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:02:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 14:02:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 14:02:47,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:02:47,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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 14:02:47,048 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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 14:02:47,048 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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 14:02:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:47,050 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 14:02:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 14:02:47,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:47,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:47,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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 74 states. [2022-02-20 14:02:47,051 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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 74 states. [2022-02-20 14:02:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:02:47,053 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 14:02:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 14:02:47,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:02:47,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:02:47,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:02:47,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:02:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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 14:02:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-02-20 14:02:47,056 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 47 [2022-02-20 14:02:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:02:47,056 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-02-20 14:02:47,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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 14:02:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 14:02:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 14:02:47,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:02:47,057 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:02:47,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:02:47,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:47,258 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:02:47,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:02:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash -888767713, now seen corresponding path program 5 times [2022-02-20 14:02:47,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:02:47,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624799897] [2022-02-20 14:02:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:02:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:02:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:02:47,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2089#true} is VALID [2022-02-20 14:02:47,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post1#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post8#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2091#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:47,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2091#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2091#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:02:47,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2092#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:47,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {2092#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2092#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:02:47,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {2092#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2093#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:47,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {2093#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2093#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:02:47,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2094#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:47,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2094#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2094#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:02:47,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2094#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2095#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:47,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2095#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:02:47,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2096#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:47,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2096#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:02:47,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2097#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:47,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {2097#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2097#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:02:47,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {2097#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2098#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:47,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {2098#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2098#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:02:47,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {2098#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2099#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:47,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {2099#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2099#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:02:47,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {2099#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2100#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:47,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {2100#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2100#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:02:47,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {2100#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2101#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:47,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {2101#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2101#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:02:47,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {2101#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2102#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:47,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {2102#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2102#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:02:47,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {2102#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2103#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:02:47,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {2103#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2103#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:02:47,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {2103#(<= |ULTIMATE.start_main_~a~0#1| 12)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2104#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:02:47,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {2104#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2104#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:02:47,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {2104#(<= |ULTIMATE.start_main_~a~0#1| 13)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2105#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:02:47,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {2105#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2105#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:02:47,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {2105#(<= |ULTIMATE.start_main_~a~0#1| 14)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2106#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:02:47,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {2106#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2106#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:02:47,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {2106#(<= |ULTIMATE.start_main_~a~0#1| 15)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2107#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:02:47,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {2107#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2107#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:02:47,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {2107#(<= |ULTIMATE.start_main_~a~0#1| 16)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2108#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:02:47,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {2108#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2108#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:02:47,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {2108#(<= |ULTIMATE.start_main_~a~0#1| 17)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2109#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:02:47,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {2109#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2109#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:02:47,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {2109#(<= |ULTIMATE.start_main_~a~0#1| 18)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2110#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:02:47,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {2110#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2110#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:02:47,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {2110#(<= |ULTIMATE.start_main_~a~0#1| 19)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2111#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:02:47,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {2111#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2111#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:02:47,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {2111#(<= |ULTIMATE.start_main_~a~0#1| 20)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2112#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:02:47,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {2112#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet3#1; {2112#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:02:47,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {2112#(<= |ULTIMATE.start_main_~a~0#1| 21)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2113#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {2113#(<= |ULTIMATE.start_main_~a~0#1| 22)} assume !(main_~a~0#1 < 100000); {2090#false} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {2090#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2090#false} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2090#false} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {2090#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2090#false} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2090#false} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {2090#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2090#false} is VALID [2022-02-20 14:02:47,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {2090#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {2090#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {2090#false} assume !(main_~i~0#1 < 100000); {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {2090#false} main_~i~0#1 := 0; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {2090#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2090#false} is VALID [2022-02-20 14:02:47,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {2090#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {2090#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {2090#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem7#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem7#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {2090#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {2090#false} assume !(main_~i~0#1 < 100000); {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {2090#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {2090#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem9#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem10#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {2090#false} assume 0 == __VERIFIER_assert_~cond#1; {2090#false} is VALID [2022-02-20 14:02:47,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {2090#false} assume !false; {2090#false} is VALID [2022-02-20 14:02:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:02:47,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:02:47,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624799897] [2022-02-20 14:02:47,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624799897] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:02:47,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689554135] [2022-02-20 14:02:47,841 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:02:47,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:02:47,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:02:47,842 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:02:47,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process