./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_compareModified_ground.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_compareModified_ground.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 ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:01:33,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:01:33,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:01:33,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:01:33,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:01:33,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:01:33,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:01:33,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:01:33,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:01:33,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:01:33,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:01:33,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:01:33,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:01:33,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:01:33,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:01:33,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:01:33,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:01:33,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:01:33,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:01:33,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:01:33,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:01:33,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:01:33,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:01:33,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:01:33,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:01:33,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:01:33,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:01:33,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:01:33,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:01:33,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:01:33,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:01:33,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:01:33,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:01:33,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:01:33,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:01:33,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:01:33,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:01:33,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:01:33,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:01:33,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:01:33,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:01:33,418 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:01:33,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:01:33,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:01:33,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:01:33,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:01:33,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:01:33,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:01:33,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:01:33,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:01:33,455 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:01:33,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:01:33,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:01:33,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:01:33,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:01:33,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:01:33,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:01:33,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:01:33,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:01:33,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:01:33,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:01:33,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:01:33,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:01:33,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:01:33,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:01:33,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:01:33,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:33,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:01:33,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:01:33,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:01:33,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:01:33,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:01:33,460 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:01:33,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:01:33,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:01:33,461 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 -> ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e [2022-02-20 14:01:33,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:01:33,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:01:33,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:01:33,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:01:33,816 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:01:33,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2022-02-20 14:01:33,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc25ed080/83a001c194654e8f9894cd8ed23b8b19/FLAG014a63457 [2022-02-20 14:01:34,326 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:01:34,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2022-02-20 14:01:34,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc25ed080/83a001c194654e8f9894cd8ed23b8b19/FLAG014a63457 [2022-02-20 14:01:34,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc25ed080/83a001c194654e8f9894cd8ed23b8b19 [2022-02-20 14:01:34,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:01:34,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:01:34,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:34,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:01:34,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:01:34,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:34" (1/1) ... [2022-02-20 14:01:34,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e35a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:34, skipping insertion in model container [2022-02-20 14:01:34,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:34" (1/1) ... [2022-02-20 14:01:34,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:01:34,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:01:34,926 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_compareModified_ground.i[824,837] [2022-02-20 14:01:34,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:34,975 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:01:34,987 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_compareModified_ground.i[824,837] [2022-02-20 14:01:34,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:35,017 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:01:35,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35 WrapperNode [2022-02-20 14:01:35,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:35,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:35,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:01:35,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:01:35,033 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:01:35" (1/1) ... [2022-02-20 14:01:35,040 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:01:35" (1/1) ... [2022-02-20 14:01:35,060 INFO L137 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2022-02-20 14:01:35,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:35,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:01:35,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:01:35,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:01:35,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:01:35,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:01:35,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:01:35,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:01:35,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (1/1) ... [2022-02-20 14:01:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:35,135 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:01:35,139 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:01:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:01:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:01:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:01:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:01:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:01:35,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:01:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:01:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 14:01:35,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 14:01:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:01:35,234 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:01:35,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:01:35,397 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:01:35,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:01:35,404 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:01:35,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:35 BoogieIcfgContainer [2022-02-20 14:01:35,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:01:35,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:01:35,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:01:35,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:01:35,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:01:34" (1/3) ... [2022-02-20 14:01:35,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3fb22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:35, skipping insertion in model container [2022-02-20 14:01:35,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:35" (2/3) ... [2022-02-20 14:01:35,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3fb22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:35, skipping insertion in model container [2022-02-20 14:01:35,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:35" (3/3) ... [2022-02-20 14:01:35,416 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2022-02-20 14:01:35,425 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:01:35,426 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:01:35,541 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:01:35,547 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:01:35,559 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:01:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:01:35,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:35,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:35,611 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -689463738, now seen corresponding path program 1 times [2022-02-20 14:01:35,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:35,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941928949] [2022-02-20 14:01:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:35,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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(34, 2); {31#true} is VALID [2022-02-20 14:01:35,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {33#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:35,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 < 100000); {32#false} is VALID [2022-02-20 14:01:35,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 14:01:35,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} havoc main_~x~0#1; {32#false} is VALID [2022-02-20 14:01:35,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {32#false} is VALID [2022-02-20 14:01:35,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {32#false} is VALID [2022-02-20 14:01:35,917 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {32#false} is VALID [2022-02-20 14:01:35,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 14:01:35,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 14:01:35,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 14:01:35,919 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:01:35,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:35,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941928949] [2022-02-20 14:01:35,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941928949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:35,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:35,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:01:35,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156870379] [2022-02-20 14:01:35,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:35,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:01:35,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:35,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:35,963 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:01:35,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:35,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:36,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:36,008 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,130 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2022-02-20 14:01:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:36,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:01:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 14:01:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 14:01:36,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-02-20 14:01:36,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:36,252 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:01:36,253 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:01:36,256 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:01:36,261 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 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:01:36,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:01:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-20 14:01:36,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:36,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,340 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,341 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,346 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:01:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:01:36,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:36,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:36,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 14:01:36,348 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 14:01:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,351 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:01:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:01:36,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:36,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:36,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:36,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 14:01:36,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 11 [2022-02-20 14:01:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:36,357 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 14:01:36,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 14:01:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:01:36,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:36,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:36,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:01:36,360 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1516796305, now seen corresponding path program 1 times [2022-02-20 14:01:36,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:36,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002008450] [2022-02-20 14:01:36,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:36,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:36,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#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(34, 2); {188#true} is VALID [2022-02-20 14:01:36,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {190#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:36,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {190#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:36,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {190#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {190#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:36,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {190#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 100000); {190#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:36,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {189#false} is VALID [2022-02-20 14:01:36,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#false} havoc main_~x~0#1; {189#false} is VALID [2022-02-20 14:01:36,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {189#false} is VALID [2022-02-20 14:01:36,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {189#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {189#false} is VALID [2022-02-20 14:01:36,436 INFO L272 TraceCheckUtils]: 9: Hoare triple {189#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {189#false} is VALID [2022-02-20 14:01:36,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#false} ~cond := #in~cond; {189#false} is VALID [2022-02-20 14:01:36,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#false} assume 0 == ~cond; {189#false} is VALID [2022-02-20 14:01:36,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {189#false} assume !false; {189#false} is VALID [2022-02-20 14:01:36,437 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:01:36,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:36,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002008450] [2022-02-20 14:01:36,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002008450] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:36,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:36,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:01:36,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877530999] [2022-02-20 14:01:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:36,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:01:36,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:36,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,459 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:01:36,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:36,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:36,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:36,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:36,461 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,511 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-02-20 14:01:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:36,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:01:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 14:01:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 14:01:36,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 14:01:36,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:36,568 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:01:36,568 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 14:01:36,572 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:01:36,575 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 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:01:36,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 14:01:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-02-20 14:01:36,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:36,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,586 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,588 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,591 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 14:01:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:01:36,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:36,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:36,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 14:01:36,592 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 14:01:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,594 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 14:01:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:01:36,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:36,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:36,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:36,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 14:01:36,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-02-20 14:01:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:36,598 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 14:01:36,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:01:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:01:36,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:36,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:36,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:01:36,600 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1600828572, now seen corresponding path program 1 times [2022-02-20 14:01:36,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:36,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239967023] [2022-02-20 14:01:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:36,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {339#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(34, 2); {339#true} is VALID [2022-02-20 14:01:36,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {341#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:36,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {341#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:36,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {342#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:36,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {342#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < 100000); {340#false} is VALID [2022-02-20 14:01:36,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {340#false} is VALID [2022-02-20 14:01:36,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {340#false} assume main_#t~mem4#1 != main_#t~mem5#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~rv~0#1 := 0; {340#false} is VALID [2022-02-20 14:01:36,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {340#false} is VALID [2022-02-20 14:01:36,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#false} assume !(main_~i~0#1 < 100000); {340#false} is VALID [2022-02-20 14:01:36,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#false} havoc main_~x~0#1; {340#false} is VALID [2022-02-20 14:01:36,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {340#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {340#false} is VALID [2022-02-20 14:01:36,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {340#false} is VALID [2022-02-20 14:01:36,658 INFO L272 TraceCheckUtils]: 12: Hoare triple {340#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {340#false} is VALID [2022-02-20 14:01:36,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#false} ~cond := #in~cond; {340#false} is VALID [2022-02-20 14:01:36,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#false} assume 0 == ~cond; {340#false} is VALID [2022-02-20 14:01:36,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-02-20 14:01:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:36,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:36,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239967023] [2022-02-20 14:01:36,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239967023] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:36,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715126868] [2022-02-20 14:01:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:36,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:36,663 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:01:36,679 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:01:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:36,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:01:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:36,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:36,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {339#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(34, 2); {339#true} is VALID [2022-02-20 14:01:36,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {339#true} is VALID [2022-02-20 14:01:36,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#true} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {339#true} is VALID [2022-02-20 14:01:36,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#true} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {339#true} is VALID [2022-02-20 14:01:36,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#true} assume !(main_~j~0#1 < 100000); {339#true} is VALID [2022-02-20 14:01:36,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {339#true} is VALID [2022-02-20 14:01:36,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#true} assume main_#t~mem4#1 != main_#t~mem5#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;main_~rv~0#1 := 0; {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} is VALID [2022-02-20 14:01:36,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} is VALID [2022-02-20 14:01:36,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} assume !(main_~i~0#1 < 100000); {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} is VALID [2022-02-20 14:01:36,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} havoc main_~x~0#1; {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} is VALID [2022-02-20 14:01:36,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#(= |ULTIMATE.start_main_~rv~0#1| 0)} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {340#false} is VALID [2022-02-20 14:01:36,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {340#false} is VALID [2022-02-20 14:01:36,886 INFO L272 TraceCheckUtils]: 12: Hoare triple {340#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {340#false} is VALID [2022-02-20 14:01:36,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#false} ~cond := #in~cond; {340#false} is VALID [2022-02-20 14:01:36,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#false} assume 0 == ~cond; {340#false} is VALID [2022-02-20 14:01:36,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-02-20 14:01:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:36,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:01:36,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715126868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:36,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:01:36,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:01:36,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164934978] [2022-02-20 14:01:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:01:36,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:36,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:36,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:36,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:01:36,917 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:36,984 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-20 14:01:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:01:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 14:01:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 14:01:36,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-02-20 14:01:37,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:37,072 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:01:37,072 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:01:37,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:01:37,077 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:37,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:01:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-02-20 14:01:37,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:37,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,089 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,090 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:37,095 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:01:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:01:37,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:37,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:37,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-02-20 14:01:37,099 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-02-20 14:01:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:37,110 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:01:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:01:37,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:37,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:37,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:37,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-20 14:01:37,116 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 16 [2022-02-20 14:01:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:37,117 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-20 14:01:37,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 14:01:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:01:37,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:37,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:37,197 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:01:37,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:37,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1993855582, now seen corresponding path program 1 times [2022-02-20 14:01:37,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:37,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817374833] [2022-02-20 14:01:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:37,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#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(34, 2); {566#true} is VALID [2022-02-20 14:01:37,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {568#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:37,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {568#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {568#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:37,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {568#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {569#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:37,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < 100000); {567#false} is VALID [2022-02-20 14:01:37,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {567#false} is VALID [2022-02-20 14:01:37,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {567#false} is VALID [2022-02-20 14:01:37,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {567#false} is VALID [2022-02-20 14:01:37,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#false} assume !(main_~i~0#1 < 100000); {567#false} is VALID [2022-02-20 14:01:37,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#false} havoc main_~x~0#1; {567#false} is VALID [2022-02-20 14:01:37,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {567#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {567#false} is VALID [2022-02-20 14:01:37,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {567#false} is VALID [2022-02-20 14:01:37,393 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {567#false} is VALID [2022-02-20 14:01:37,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2022-02-20 14:01:37,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2022-02-20 14:01:37,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} assume !false; {567#false} is VALID [2022-02-20 14:01:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:37,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:37,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817374833] [2022-02-20 14:01:37,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817374833] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:37,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71693633] [2022-02-20 14:01:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:37,396 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:01:37,397 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:01:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:37,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:01:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:37,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:37,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#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(34, 2); {566#true} is VALID [2022-02-20 14:01:37,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {576#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:37,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {576#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:37,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {576#(<= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {569#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:37,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < 100000); {567#false} is VALID [2022-02-20 14:01:37,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {567#false} is VALID [2022-02-20 14:01:37,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {567#false} is VALID [2022-02-20 14:01:37,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {567#false} is VALID [2022-02-20 14:01:37,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#false} assume !(main_~i~0#1 < 100000); {567#false} is VALID [2022-02-20 14:01:37,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#false} havoc main_~x~0#1; {567#false} is VALID [2022-02-20 14:01:37,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {567#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {567#false} is VALID [2022-02-20 14:01:37,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {567#false} is VALID [2022-02-20 14:01:37,567 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {567#false} is VALID [2022-02-20 14:01:37,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2022-02-20 14:01:37,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2022-02-20 14:01:37,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} assume !false; {567#false} is VALID [2022-02-20 14:01:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:37,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:37,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} assume !false; {567#false} is VALID [2022-02-20 14:01:37,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2022-02-20 14:01:37,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2022-02-20 14:01:37,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {567#false} is VALID [2022-02-20 14:01:37,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {567#false} is VALID [2022-02-20 14:01:37,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {567#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {567#false} is VALID [2022-02-20 14:01:37,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#false} havoc main_~x~0#1; {567#false} is VALID [2022-02-20 14:01:37,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#false} assume !(main_~i~0#1 < 100000); {567#false} is VALID [2022-02-20 14:01:37,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {567#false} is VALID [2022-02-20 14:01:37,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {567#false} is VALID [2022-02-20 14:01:37,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {567#false} is VALID [2022-02-20 14:01:37,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {652#(< |ULTIMATE.start_main_~j~0#1| 100000)} assume !(main_~j~0#1 < 100000); {567#false} is VALID [2022-02-20 14:01:37,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {656#(< |ULTIMATE.start_main_~j~0#1| 99999)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {652#(< |ULTIMATE.start_main_~j~0#1| 100000)} is VALID [2022-02-20 14:01:37,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#(< |ULTIMATE.start_main_~j~0#1| 99999)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {656#(< |ULTIMATE.start_main_~j~0#1| 99999)} is VALID [2022-02-20 14:01:37,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {656#(< |ULTIMATE.start_main_~j~0#1| 99999)} is VALID [2022-02-20 14:01:37,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#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(34, 2); {566#true} is VALID [2022-02-20 14:01:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:37,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71693633] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:37,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:37,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:01:37,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642938569] [2022-02-20 14:01:37,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:01:37,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:37,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:37,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:37,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:01:37,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:01:37,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:01:37,703 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:37,815 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-02-20 14:01:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:01:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:01:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-02-20 14:01:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-02-20 14:01:37,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-02-20 14:01:37,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:37,880 INFO L225 Difference]: With dead ends: 63 [2022-02-20 14:01:37,880 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:01:37,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:01:37,882 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:37,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:01:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 14:01:37,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:37,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,893 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,894 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:37,895 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-02-20 14:01:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 14:01:37,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:37,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:37,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-02-20 14:01:37,896 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-02-20 14:01:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:37,898 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-02-20 14:01:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 14:01:37,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:37,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:37,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:37,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-02-20 14:01:37,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 16 [2022-02-20 14:01:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:37,904 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-02-20 14:01:37,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 14:01:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:01:37,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:37,906 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:37,932 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:01:38,129 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,SelfDestructingSolverStorable3 [2022-02-20 14:01:38,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash 337565480, now seen corresponding path program 2 times [2022-02-20 14:01:38,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:38,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581609645] [2022-02-20 14:01:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:38,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {864#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(34, 2); {864#true} is VALID [2022-02-20 14:01:38,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 100000); {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {866#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:38,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {867#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:01:38,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {865#false} is VALID [2022-02-20 14:01:38,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {865#false} havoc main_~x~0#1; {865#false} is VALID [2022-02-20 14:01:38,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {865#false} is VALID [2022-02-20 14:01:38,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {865#false} is VALID [2022-02-20 14:01:38,219 INFO L272 TraceCheckUtils]: 18: Hoare triple {865#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {865#false} is VALID [2022-02-20 14:01:38,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2022-02-20 14:01:38,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2022-02-20 14:01:38,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-02-20 14:01:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:01:38,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:38,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581609645] [2022-02-20 14:01:38,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581609645] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:38,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104954940] [2022-02-20 14:01:38,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:01:38,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:38,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:38,223 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:01:38,224 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:01:38,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:01:38,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:01:38,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:01:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:38,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:38,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {864#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(34, 2); {864#true} is VALID [2022-02-20 14:01:38,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {874#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:38,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {874#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {874#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:38,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {874#(<= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {881#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:38,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {881#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:38,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {888#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:38,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {888#(<= |ULTIMATE.start_main_~j~0#1| 2)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {888#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:38,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {888#(<= |ULTIMATE.start_main_~j~0#1| 2)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {895#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:38,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {895#(<= |ULTIMATE.start_main_~j~0#1| 3)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {895#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:38,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#(<= |ULTIMATE.start_main_~j~0#1| 3)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {902#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:38,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {902#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !(main_~j~0#1 < 100000); {865#false} is VALID [2022-02-20 14:01:38,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {865#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {865#false} is VALID [2022-02-20 14:01:38,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {865#false} is VALID [2022-02-20 14:01:38,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {865#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {865#false} is VALID [2022-02-20 14:01:38,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(main_~i~0#1 < 100000); {865#false} is VALID [2022-02-20 14:01:38,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {865#false} havoc main_~x~0#1; {865#false} is VALID [2022-02-20 14:01:38,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {865#false} is VALID [2022-02-20 14:01:38,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {865#false} is VALID [2022-02-20 14:01:38,484 INFO L272 TraceCheckUtils]: 18: Hoare triple {865#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {865#false} is VALID [2022-02-20 14:01:38,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2022-02-20 14:01:38,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2022-02-20 14:01:38,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-02-20 14:01:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:38,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:38,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-02-20 14:01:38,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2022-02-20 14:01:38,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2022-02-20 14:01:38,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {865#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {865#false} is VALID [2022-02-20 14:01:38,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {865#false} is VALID [2022-02-20 14:01:38,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {865#false} is VALID [2022-02-20 14:01:38,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {865#false} havoc main_~x~0#1; {865#false} is VALID [2022-02-20 14:01:38,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(main_~i~0#1 < 100000); {865#false} is VALID [2022-02-20 14:01:38,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {865#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {865#false} is VALID [2022-02-20 14:01:38,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {865#false} is VALID [2022-02-20 14:01:38,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {865#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {865#false} is VALID [2022-02-20 14:01:38,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {972#(< |ULTIMATE.start_main_~j~0#1| 100000)} assume !(main_~j~0#1 < 100000); {865#false} is VALID [2022-02-20 14:01:38,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {976#(< |ULTIMATE.start_main_~j~0#1| 99999)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {972#(< |ULTIMATE.start_main_~j~0#1| 100000)} is VALID [2022-02-20 14:01:38,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {976#(< |ULTIMATE.start_main_~j~0#1| 99999)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {976#(< |ULTIMATE.start_main_~j~0#1| 99999)} is VALID [2022-02-20 14:01:38,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {983#(< |ULTIMATE.start_main_~j~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {976#(< |ULTIMATE.start_main_~j~0#1| 99999)} is VALID [2022-02-20 14:01:38,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {983#(< |ULTIMATE.start_main_~j~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {983#(< |ULTIMATE.start_main_~j~0#1| 99998)} is VALID [2022-02-20 14:01:38,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {990#(< |ULTIMATE.start_main_~j~0#1| 99997)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {983#(< |ULTIMATE.start_main_~j~0#1| 99998)} is VALID [2022-02-20 14:01:38,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {990#(< |ULTIMATE.start_main_~j~0#1| 99997)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {990#(< |ULTIMATE.start_main_~j~0#1| 99997)} is VALID [2022-02-20 14:01:38,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {997#(< |ULTIMATE.start_main_~j~0#1| 99996)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {990#(< |ULTIMATE.start_main_~j~0#1| 99997)} is VALID [2022-02-20 14:01:38,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {997#(< |ULTIMATE.start_main_~j~0#1| 99996)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {997#(< |ULTIMATE.start_main_~j~0#1| 99996)} is VALID [2022-02-20 14:01:38,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {997#(< |ULTIMATE.start_main_~j~0#1| 99996)} is VALID [2022-02-20 14:01:38,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {864#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(34, 2); {864#true} is VALID [2022-02-20 14:01:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:38,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104954940] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:38,660 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:38,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:01:38,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947805936] [2022-02-20 14:01:38,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:01:38,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:38,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:38,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:38,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:01:38,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:01:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:01:38,716 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:38,985 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2022-02-20 14:01:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:01:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:01:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2022-02-20 14:01:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2022-02-20 14:01:38,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 89 transitions. [2022-02-20 14:01:39,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:39,070 INFO L225 Difference]: With dead ends: 84 [2022-02-20 14:01:39,070 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 14:01:39,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:01:39,071 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:39,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 14:01:39,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-02-20 14:01:39,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:39,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:39,089 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:39,089 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:39,091 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-02-20 14:01:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-02-20 14:01:39,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:39,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:39,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 58 states. [2022-02-20 14:01:39,092 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 58 states. [2022-02-20 14:01:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:39,094 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-02-20 14:01:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-02-20 14:01:39,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:39,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:39,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:39,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-02-20 14:01:39,098 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 22 [2022-02-20 14:01:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:39,099 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-02-20 14:01:39,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-02-20 14:01:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:01:39,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:39,100 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:39,127 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:01:39,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:39,316 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1777859901, now seen corresponding path program 3 times [2022-02-20 14:01:39,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:39,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322979032] [2022-02-20 14:01:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:39,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {1317#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(34, 2); {1317#true} is VALID [2022-02-20 14:01:39,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {1319#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:39,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {1319#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1319#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:39,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {1319#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1320#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:39,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {1320#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1320#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:39,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {1320#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1321#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:39,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {1321#(<= |ULTIMATE.start_main_~j~0#1| 2)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1321#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:39,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {1321#(<= |ULTIMATE.start_main_~j~0#1| 2)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1322#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:39,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {1322#(<= |ULTIMATE.start_main_~j~0#1| 3)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1322#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:39,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {1322#(<= |ULTIMATE.start_main_~j~0#1| 3)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1323#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:39,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {1323#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1323#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:39,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {1323#(<= |ULTIMATE.start_main_~j~0#1| 4)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1324#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:39,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {1324#(<= |ULTIMATE.start_main_~j~0#1| 5)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1324#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:39,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#(<= |ULTIMATE.start_main_~j~0#1| 5)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1325#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:39,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#(<= |ULTIMATE.start_main_~j~0#1| 6)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1325#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:39,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#(<= |ULTIMATE.start_main_~j~0#1| 6)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1326#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:39,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1326#(<= |ULTIMATE.start_main_~j~0#1| 7)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1326#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:39,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {1326#(<= |ULTIMATE.start_main_~j~0#1| 7)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1327#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:39,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {1327#(<= |ULTIMATE.start_main_~j~0#1| 8)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1327#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:39,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {1327#(<= |ULTIMATE.start_main_~j~0#1| 8)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1328#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:39,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {1328#(<= |ULTIMATE.start_main_~j~0#1| 9)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1328#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:39,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {1328#(<= |ULTIMATE.start_main_~j~0#1| 9)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1329#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:39,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#(<= |ULTIMATE.start_main_~j~0#1| 10)} assume !(main_~j~0#1 < 100000); {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {1318#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {1318#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {1318#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {1318#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {1318#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {1318#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1318#false} is VALID [2022-02-20 14:01:39,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {1318#false} assume !(main_~i~0#1 < 100000); {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {1318#false} havoc main_~x~0#1; {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {1318#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {1318#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L272 TraceCheckUtils]: 33: Hoare triple {1318#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {1318#false} ~cond := #in~cond; {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {1318#false} assume 0 == ~cond; {1318#false} is VALID [2022-02-20 14:01:39,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2022-02-20 14:01:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:01:39,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:39,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322979032] [2022-02-20 14:01:39,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322979032] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:39,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785771325] [2022-02-20 14:01:39,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:01:39,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:39,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:39,663 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:01:39,681 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:01:39,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:01:39,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:01:39,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:01:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:39,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:39,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {1317#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(34, 2); {1317#true} is VALID [2022-02-20 14:01:39,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 100000); {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:39,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {1336#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1409#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:01:39,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {1409#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1409#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:01:39,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {1409#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1409#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:01:39,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {1409#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:01:39,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {1318#false} is VALID [2022-02-20 14:01:39,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {1318#false} havoc main_~x~0#1; {1318#false} is VALID [2022-02-20 14:01:39,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {1318#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {1318#false} is VALID [2022-02-20 14:01:39,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {1318#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {1318#false} is VALID [2022-02-20 14:01:39,943 INFO L272 TraceCheckUtils]: 33: Hoare triple {1318#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {1318#false} is VALID [2022-02-20 14:01:39,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {1318#false} ~cond := #in~cond; {1318#false} is VALID [2022-02-20 14:01:39,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {1318#false} assume 0 == ~cond; {1318#false} is VALID [2022-02-20 14:01:39,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2022-02-20 14:01:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:01:39,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:40,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2022-02-20 14:01:40,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {1318#false} assume 0 == ~cond; {1318#false} is VALID [2022-02-20 14:01:40,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {1318#false} ~cond := #in~cond; {1318#false} is VALID [2022-02-20 14:01:40,120 INFO L272 TraceCheckUtils]: 33: Hoare triple {1318#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {1318#false} is VALID [2022-02-20 14:01:40,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {1318#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {1318#false} is VALID [2022-02-20 14:01:40,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {1318#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {1318#false} is VALID [2022-02-20 14:01:40,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {1318#false} havoc main_~x~0#1; {1318#false} is VALID [2022-02-20 14:01:40,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {1465#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1318#false} is VALID [2022-02-20 14:01:40,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {1469#(< |ULTIMATE.start_main_~i~0#1| 99999)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1465#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:01:40,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {1469#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1469#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:01:40,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {1469#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1469#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:01:40,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1469#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:01:40,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(main_~j~0#1 < 100000); {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {1479#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:01:40,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {1317#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(34, 2); {1317#true} is VALID [2022-02-20 14:01:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:01:40,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785771325] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:40,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:40,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-02-20 14:01:40,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611433858] [2022-02-20 14:01:40,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 14:01:40,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:40,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:40,182 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:01:40,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:01:40,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:01:40,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:01:40,184 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:40,575 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2022-02-20 14:01:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:01:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 14:01:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 103 transitions. [2022-02-20 14:01:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 103 transitions. [2022-02-20 14:01:40,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 103 transitions. [2022-02-20 14:01:40,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:40,670 INFO L225 Difference]: With dead ends: 112 [2022-02-20 14:01:40,670 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 14:01:40,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=314, Invalid=556, Unknown=0, NotChecked=0, Total=870 [2022-02-20 14:01:40,672 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:40,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 105 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:01:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 14:01:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-02-20 14:01:40,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:40,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:40,694 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:40,695 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:40,697 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-02-20 14:01:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2022-02-20 14:01:40,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:40,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:40,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-02-20 14:01:40,698 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-02-20 14:01:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:40,701 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-02-20 14:01:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2022-02-20 14:01:40,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:40,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:40,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:40,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-02-20 14:01:40,704 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 37 [2022-02-20 14:01:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:40,704 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-02-20 14:01:40,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-02-20 14:01:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 14:01:40,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:40,705 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:40,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:01:40,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:40,915 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -819554885, now seen corresponding path program 4 times [2022-02-20 14:01:40,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:40,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722168410] [2022-02-20 14:01:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:41,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {1969#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(34, 2); {1969#true} is VALID [2022-02-20 14:01:41,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {1969#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {1971#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:41,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1971#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:41,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {1971#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:41,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:41,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:41,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:41,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:41,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:41,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:41,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:41,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:41,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:41,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:41,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:41,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:41,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:41,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:41,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:41,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:41,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:41,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:41,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:41,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1982#(<= |ULTIMATE.start_main_~j~0#1| 11)} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {1982#(<= |ULTIMATE.start_main_~j~0#1| 11)} assume !(main_~j~0#1 < 100000); {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {1970#false} assume !(main_~i~0#1 < 100000); {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {1970#false} havoc main_~x~0#1; {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {1970#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {1970#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L272 TraceCheckUtils]: 47: Hoare triple {1970#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {1970#false} ~cond := #in~cond; {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {1970#false} assume 0 == ~cond; {1970#false} is VALID [2022-02-20 14:01:41,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {1970#false} assume !false; {1970#false} is VALID [2022-02-20 14:01:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 14:01:41,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:41,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722168410] [2022-02-20 14:01:41,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722168410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:41,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145589370] [2022-02-20 14:01:41,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:01:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:41,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:41,154 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:01:41,164 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:01:41,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:01:41,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:01:41,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:01:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:41,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:41,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {1969#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(34, 2); {1969#true} is VALID [2022-02-20 14:01:41,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {1969#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {1989#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:41,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1989#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:41,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {1989#(<= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:41,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:41,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:41,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:41,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {1973#(<= |ULTIMATE.start_main_~j~0#1| 2)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:41,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:41,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {1974#(<= |ULTIMATE.start_main_~j~0#1| 3)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:41,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:41,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {1975#(<= |ULTIMATE.start_main_~j~0#1| 4)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:41,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:41,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1976#(<= |ULTIMATE.start_main_~j~0#1| 5)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:41,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:41,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {1977#(<= |ULTIMATE.start_main_~j~0#1| 6)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:41,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:41,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#(<= |ULTIMATE.start_main_~j~0#1| 7)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:41,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:41,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1979#(<= |ULTIMATE.start_main_~j~0#1| 8)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:41,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:41,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1980#(<= |ULTIMATE.start_main_~j~0#1| 9)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:41,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:41,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1981#(<= |ULTIMATE.start_main_~j~0#1| 10)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1982#(<= |ULTIMATE.start_main_~j~0#1| 11)} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {1982#(<= |ULTIMATE.start_main_~j~0#1| 11)} assume !(main_~j~0#1 < 100000); {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:41,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:41,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {1970#false} assume !(main_~i~0#1 < 100000); {1970#false} is VALID [2022-02-20 14:01:41,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {1970#false} havoc main_~x~0#1; {1970#false} is VALID [2022-02-20 14:01:41,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {1970#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {1970#false} is VALID [2022-02-20 14:01:41,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {1970#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:41,576 INFO L272 TraceCheckUtils]: 47: Hoare triple {1970#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {1970#false} is VALID [2022-02-20 14:01:41,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {1970#false} ~cond := #in~cond; {1970#false} is VALID [2022-02-20 14:01:41,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {1970#false} assume 0 == ~cond; {1970#false} is VALID [2022-02-20 14:01:41,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {1970#false} assume !false; {1970#false} is VALID [2022-02-20 14:01:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 14:01:41,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {1970#false} assume !false; {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {1970#false} assume 0 == ~cond; {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {1970#false} ~cond := #in~cond; {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L272 TraceCheckUtils]: 47: Hoare triple {1970#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {1970#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {1970#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {1970#false} havoc main_~x~0#1; {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {1970#false} assume !(main_~i~0#1 < 100000); {1970#false} is VALID [2022-02-20 14:01:42,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:42,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {1970#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {1970#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {1970#false} is VALID [2022-02-20 14:01:42,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {1970#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {1970#false} is VALID [2022-02-20 14:01:42,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(< |ULTIMATE.start_main_~j~0#1| 100000)} assume !(main_~j~0#1 < 100000); {1970#false} is VALID [2022-02-20 14:01:42,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {2219#(< |ULTIMATE.start_main_~j~0#1| 99999)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2215#(< |ULTIMATE.start_main_~j~0#1| 100000)} is VALID [2022-02-20 14:01:42,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {2219#(< |ULTIMATE.start_main_~j~0#1| 99999)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2219#(< |ULTIMATE.start_main_~j~0#1| 99999)} is VALID [2022-02-20 14:01:42,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(< |ULTIMATE.start_main_~j~0#1| 99998)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2219#(< |ULTIMATE.start_main_~j~0#1| 99999)} is VALID [2022-02-20 14:01:42,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2226#(< |ULTIMATE.start_main_~j~0#1| 99998)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2226#(< |ULTIMATE.start_main_~j~0#1| 99998)} is VALID [2022-02-20 14:01:42,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {2233#(< |ULTIMATE.start_main_~j~0#1| 99997)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2226#(< |ULTIMATE.start_main_~j~0#1| 99998)} is VALID [2022-02-20 14:01:42,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {2233#(< |ULTIMATE.start_main_~j~0#1| 99997)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2233#(< |ULTIMATE.start_main_~j~0#1| 99997)} is VALID [2022-02-20 14:01:42,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2240#(< |ULTIMATE.start_main_~j~0#1| 99996)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2233#(< |ULTIMATE.start_main_~j~0#1| 99997)} is VALID [2022-02-20 14:01:42,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {2240#(< |ULTIMATE.start_main_~j~0#1| 99996)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2240#(< |ULTIMATE.start_main_~j~0#1| 99996)} is VALID [2022-02-20 14:01:42,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2247#(< |ULTIMATE.start_main_~j~0#1| 99995)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2240#(< |ULTIMATE.start_main_~j~0#1| 99996)} is VALID [2022-02-20 14:01:42,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {2247#(< |ULTIMATE.start_main_~j~0#1| 99995)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2247#(< |ULTIMATE.start_main_~j~0#1| 99995)} is VALID [2022-02-20 14:01:42,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {2254#(< |ULTIMATE.start_main_~j~0#1| 99994)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2247#(< |ULTIMATE.start_main_~j~0#1| 99995)} is VALID [2022-02-20 14:01:42,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {2254#(< |ULTIMATE.start_main_~j~0#1| 99994)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2254#(< |ULTIMATE.start_main_~j~0#1| 99994)} is VALID [2022-02-20 14:01:42,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(< |ULTIMATE.start_main_~j~0#1| 99993)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2254#(< |ULTIMATE.start_main_~j~0#1| 99994)} is VALID [2022-02-20 14:01:42,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(< |ULTIMATE.start_main_~j~0#1| 99993)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2261#(< |ULTIMATE.start_main_~j~0#1| 99993)} is VALID [2022-02-20 14:01:42,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {2268#(< |ULTIMATE.start_main_~j~0#1| 99992)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2261#(< |ULTIMATE.start_main_~j~0#1| 99993)} is VALID [2022-02-20 14:01:42,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {2268#(< |ULTIMATE.start_main_~j~0#1| 99992)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2268#(< |ULTIMATE.start_main_~j~0#1| 99992)} is VALID [2022-02-20 14:01:42,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {2275#(< |ULTIMATE.start_main_~j~0#1| 99991)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2268#(< |ULTIMATE.start_main_~j~0#1| 99992)} is VALID [2022-02-20 14:01:42,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {2275#(< |ULTIMATE.start_main_~j~0#1| 99991)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2275#(< |ULTIMATE.start_main_~j~0#1| 99991)} is VALID [2022-02-20 14:01:42,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#(< |ULTIMATE.start_main_~j~0#1| 99990)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2275#(< |ULTIMATE.start_main_~j~0#1| 99991)} is VALID [2022-02-20 14:01:42,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {2282#(< |ULTIMATE.start_main_~j~0#1| 99990)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2282#(< |ULTIMATE.start_main_~j~0#1| 99990)} is VALID [2022-02-20 14:01:42,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {2289#(< |ULTIMATE.start_main_~j~0#1| 99989)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2282#(< |ULTIMATE.start_main_~j~0#1| 99990)} is VALID [2022-02-20 14:01:42,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2289#(< |ULTIMATE.start_main_~j~0#1| 99989)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2289#(< |ULTIMATE.start_main_~j~0#1| 99989)} is VALID [2022-02-20 14:01:42,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1969#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {2289#(< |ULTIMATE.start_main_~j~0#1| 99989)} is VALID [2022-02-20 14:01:42,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {1969#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(34, 2); {1969#true} is VALID [2022-02-20 14:01:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 14:01:42,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145589370] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:42,070 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:42,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-02-20 14:01:42,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433177419] [2022-02-20 14:01:42,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 14:01:42,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:42,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:42,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:42,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 14:01:42,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 14:01:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-02-20 14:01:42,117 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:42,360 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2022-02-20 14:01:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 14:01:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 14:01:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 115 transitions. [2022-02-20 14:01:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 115 transitions. [2022-02-20 14:01:42,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 115 transitions. [2022-02-20 14:01:42,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:42,461 INFO L225 Difference]: With dead ends: 161 [2022-02-20 14:01:42,461 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 14:01:42,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-02-20 14:01:42,462 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:42,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 132 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:01:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 14:01:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 14:01:42,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:42,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 102 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:42,502 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 102 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:42,503 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 102 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:42,506 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-02-20 14:01:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-02-20 14:01:42,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:42,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:42,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 102 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-02-20 14:01:42,508 INFO L87 Difference]: Start difference. First operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 102 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-02-20 14:01:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:42,513 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-02-20 14:01:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-02-20 14:01:42,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:42,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:42,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:42,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 102 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-02-20 14:01:42,518 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 51 [2022-02-20 14:01:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:42,518 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-02-20 14:01:42,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-02-20 14:01:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 14:01:42,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:42,521 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:42,551 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:01:42,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:42,744 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:42,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1713362591, now seen corresponding path program 5 times [2022-02-20 14:01:42,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:42,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733529069] [2022-02-20 14:01:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:43,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {2842#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(34, 2); {2842#true} is VALID [2022-02-20 14:01:43,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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_~j~0#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~i~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~rv~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(400000);main_~rv~0#1 := 1;main_~j~0#1 := 0; {2844#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:43,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {2844#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2844#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:01:43,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {2844#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2845#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:43,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {2845#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2845#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 14:01:43,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {2845#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2846#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:43,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {2846#(<= |ULTIMATE.start_main_~j~0#1| 2)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2846#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 14:01:43,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {2846#(<= |ULTIMATE.start_main_~j~0#1| 2)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2847#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:43,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {2847#(<= |ULTIMATE.start_main_~j~0#1| 3)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2847#(<= |ULTIMATE.start_main_~j~0#1| 3)} is VALID [2022-02-20 14:01:43,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#(<= |ULTIMATE.start_main_~j~0#1| 3)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2848#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:43,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {2848#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2848#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-20 14:01:43,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {2848#(<= |ULTIMATE.start_main_~j~0#1| 4)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2849#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:43,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {2849#(<= |ULTIMATE.start_main_~j~0#1| 5)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2849#(<= |ULTIMATE.start_main_~j~0#1| 5)} is VALID [2022-02-20 14:01:43,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {2849#(<= |ULTIMATE.start_main_~j~0#1| 5)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2850#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:43,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#(<= |ULTIMATE.start_main_~j~0#1| 6)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2850#(<= |ULTIMATE.start_main_~j~0#1| 6)} is VALID [2022-02-20 14:01:43,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {2850#(<= |ULTIMATE.start_main_~j~0#1| 6)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2851#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:43,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {2851#(<= |ULTIMATE.start_main_~j~0#1| 7)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2851#(<= |ULTIMATE.start_main_~j~0#1| 7)} is VALID [2022-02-20 14:01:43,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {2851#(<= |ULTIMATE.start_main_~j~0#1| 7)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2852#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:43,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {2852#(<= |ULTIMATE.start_main_~j~0#1| 8)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2852#(<= |ULTIMATE.start_main_~j~0#1| 8)} is VALID [2022-02-20 14:01:43,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#(<= |ULTIMATE.start_main_~j~0#1| 8)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2853#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:43,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {2853#(<= |ULTIMATE.start_main_~j~0#1| 9)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2853#(<= |ULTIMATE.start_main_~j~0#1| 9)} is VALID [2022-02-20 14:01:43,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {2853#(<= |ULTIMATE.start_main_~j~0#1| 9)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2854#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:43,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {2854#(<= |ULTIMATE.start_main_~j~0#1| 10)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2854#(<= |ULTIMATE.start_main_~j~0#1| 10)} is VALID [2022-02-20 14:01:43,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {2854#(<= |ULTIMATE.start_main_~j~0#1| 10)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2855#(<= |ULTIMATE.start_main_~j~0#1| 11)} is VALID [2022-02-20 14:01:43,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {2855#(<= |ULTIMATE.start_main_~j~0#1| 11)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2855#(<= |ULTIMATE.start_main_~j~0#1| 11)} is VALID [2022-02-20 14:01:43,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {2855#(<= |ULTIMATE.start_main_~j~0#1| 11)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2856#(<= |ULTIMATE.start_main_~j~0#1| 12)} is VALID [2022-02-20 14:01:43,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {2856#(<= |ULTIMATE.start_main_~j~0#1| 12)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2856#(<= |ULTIMATE.start_main_~j~0#1| 12)} is VALID [2022-02-20 14:01:43,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {2856#(<= |ULTIMATE.start_main_~j~0#1| 12)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2857#(<= |ULTIMATE.start_main_~j~0#1| 13)} is VALID [2022-02-20 14:01:43,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {2857#(<= |ULTIMATE.start_main_~j~0#1| 13)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2857#(<= |ULTIMATE.start_main_~j~0#1| 13)} is VALID [2022-02-20 14:01:43,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {2857#(<= |ULTIMATE.start_main_~j~0#1| 13)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2858#(<= |ULTIMATE.start_main_~j~0#1| 14)} is VALID [2022-02-20 14:01:43,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {2858#(<= |ULTIMATE.start_main_~j~0#1| 14)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2858#(<= |ULTIMATE.start_main_~j~0#1| 14)} is VALID [2022-02-20 14:01:43,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {2858#(<= |ULTIMATE.start_main_~j~0#1| 14)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2859#(<= |ULTIMATE.start_main_~j~0#1| 15)} is VALID [2022-02-20 14:01:43,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {2859#(<= |ULTIMATE.start_main_~j~0#1| 15)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2859#(<= |ULTIMATE.start_main_~j~0#1| 15)} is VALID [2022-02-20 14:01:43,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {2859#(<= |ULTIMATE.start_main_~j~0#1| 15)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2860#(<= |ULTIMATE.start_main_~j~0#1| 16)} is VALID [2022-02-20 14:01:43,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {2860#(<= |ULTIMATE.start_main_~j~0#1| 16)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2860#(<= |ULTIMATE.start_main_~j~0#1| 16)} is VALID [2022-02-20 14:01:43,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {2860#(<= |ULTIMATE.start_main_~j~0#1| 16)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2861#(<= |ULTIMATE.start_main_~j~0#1| 17)} is VALID [2022-02-20 14:01:43,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {2861#(<= |ULTIMATE.start_main_~j~0#1| 17)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2861#(<= |ULTIMATE.start_main_~j~0#1| 17)} is VALID [2022-02-20 14:01:43,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {2861#(<= |ULTIMATE.start_main_~j~0#1| 17)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2862#(<= |ULTIMATE.start_main_~j~0#1| 18)} is VALID [2022-02-20 14:01:43,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {2862#(<= |ULTIMATE.start_main_~j~0#1| 18)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2862#(<= |ULTIMATE.start_main_~j~0#1| 18)} is VALID [2022-02-20 14:01:43,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {2862#(<= |ULTIMATE.start_main_~j~0#1| 18)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2863#(<= |ULTIMATE.start_main_~j~0#1| 19)} is VALID [2022-02-20 14:01:43,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {2863#(<= |ULTIMATE.start_main_~j~0#1| 19)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2863#(<= |ULTIMATE.start_main_~j~0#1| 19)} is VALID [2022-02-20 14:01:43,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {2863#(<= |ULTIMATE.start_main_~j~0#1| 19)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2864#(<= |ULTIMATE.start_main_~j~0#1| 20)} is VALID [2022-02-20 14:01:43,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {2864#(<= |ULTIMATE.start_main_~j~0#1| 20)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2864#(<= |ULTIMATE.start_main_~j~0#1| 20)} is VALID [2022-02-20 14:01:43,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {2864#(<= |ULTIMATE.start_main_~j~0#1| 20)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2865#(<= |ULTIMATE.start_main_~j~0#1| 21)} is VALID [2022-02-20 14:01:43,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {2865#(<= |ULTIMATE.start_main_~j~0#1| 21)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2865#(<= |ULTIMATE.start_main_~j~0#1| 21)} is VALID [2022-02-20 14:01:43,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {2865#(<= |ULTIMATE.start_main_~j~0#1| 21)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2866#(<= |ULTIMATE.start_main_~j~0#1| 22)} is VALID [2022-02-20 14:01:43,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {2866#(<= |ULTIMATE.start_main_~j~0#1| 22)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2866#(<= |ULTIMATE.start_main_~j~0#1| 22)} is VALID [2022-02-20 14:01:43,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {2866#(<= |ULTIMATE.start_main_~j~0#1| 22)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2867#(<= |ULTIMATE.start_main_~j~0#1| 23)} is VALID [2022-02-20 14:01:43,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {2867#(<= |ULTIMATE.start_main_~j~0#1| 23)} assume !!(main_~j~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~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_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet3#1; {2867#(<= |ULTIMATE.start_main_~j~0#1| 23)} is VALID [2022-02-20 14:01:43,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {2867#(<= |ULTIMATE.start_main_~j~0#1| 23)} main_#t~post1#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2868#(<= |ULTIMATE.start_main_~j~0#1| 24)} is VALID [2022-02-20 14:01:43,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {2868#(<= |ULTIMATE.start_main_~j~0#1| 24)} assume !(main_~j~0#1 < 100000); {2843#false} is VALID [2022-02-20 14:01:43,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {2843#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {2843#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {2843#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {2843#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {2843#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {2843#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {2843#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {2843#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {2843#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {2843#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {2843#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {2843#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {2843#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {2843#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {2843#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {2843#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {2843#false} assume !(main_#t~mem4#1 != main_#t~mem5#1);havoc main_#t~mem4#1;havoc main_#t~mem5#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {2843#false} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#c~0#1.base, main_~#c~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1;main_~i~0#1 := 1 + main_~i~0#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {2843#false} assume !(main_~i~0#1 < 100000); {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {2843#false} havoc main_~x~0#1; {2843#false} is VALID [2022-02-20 14:01:43,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {2843#false} assume 0 != main_~rv~0#1;main_~x~0#1 := 0; {2843#false} is VALID [2022-02-20 14:01:43,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {2843#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem9#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4); {2843#false} is VALID [2022-02-20 14:01:43,277 INFO L272 TraceCheckUtils]: 73: Hoare triple {2843#false} call __VERIFIER_assert((if main_#t~mem8#1 == main_#t~mem9#1 then 1 else 0)); {2843#false} is VALID [2022-02-20 14:01:43,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {2843#false} ~cond := #in~cond; {2843#false} is VALID [2022-02-20 14:01:43,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {2843#false} assume 0 == ~cond; {2843#false} is VALID [2022-02-20 14:01:43,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-02-20 14:01:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 14:01:43,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:43,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733529069] [2022-02-20 14:01:43,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733529069] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:43,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736807715] [2022-02-20 14:01:43,278 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:01:43,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:43,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:43,283 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:01:43,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process